• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Mirror of Tree

February 10, 2015 by Dhaval Dave

Write a code to construct a Mirror of Binary Tree as below.

Solution 1 ) Create a New Tree and store nodes in the way we want (mirrored way)

Algo :

struct node{
    int value;
    struct node* left;
    struct node* right;
};
struct node *mirrorTree(struct node *root){
  struct node *temp;
  if(root==NULL)
    return(NULL);
  temp = (struct node *) malloc(sizeof(struct node));
  temp->value = root->value;
  temp->left  = mirrorTree(root->right);
  temp->right = mirrorTree(root->left);
  return(temp);
}
Solution 2 ) In place change ( Use Recursion )

 

void mirror(struct node* node) 
{
  if (node==NULL) 
    return;  
  else
  {
    struct node* temp;

    mirror(node->left);
    mirror(node->right);
 
    /* swap the pointers */
      temp        = node->left;
      node->left  = node->right;
      node->right = temp;
  }
}
See working Code at : http://ideone.com/uDrfeu
See Video : 

Similar Articles

Filed Under: Amazon Interview Question, Interview Questions, problem Tagged With: Binary Tree, tree

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Maximum path sum between two leaves

25 horses 5 tracks Find 3 fastest puzzle

CodeChef’ RRCOPY

Print all nodes that are at distance k from a leaf node

Maximum difference between two elements s.t larger element appears after the smaller number

Daughter’s Age VeryGood Puzzle

Leetcode: Merge Intervals

Skiing on Mountains Matrix

Check Binary Tree is Binary Search Tree or not

Find the element that appears once others appears thrice

Sort an array according to the order defined by another array

Closed Parentheses checker

Diagonal Traversal of Binary Tree

Convert number to words java

DFS (Depth First Search)

Search element in a matrix with all rows and columns in sorted order

Doubly linked list

1014 Practice Question of New GRE – Princeton

Minimum insertions to form a palindrome

Test Cases for Round Function

TicTacToe Game As Asked in Flipkart

Urban Ladder Written Test.

Binary Tree Isomorphic to each other

VMWare SDEII Interview

Password Predictor

Apriori algorithm C Code Data Mining

Find min element in Sorted Rotated Array (With Duplicates)

BFS (Breath First Search)

Linked List V/S Binary Search Tree

Given Set of words or A String find whether chain is possible from these words or not

Copyright © 2025 · Genesis Framework · WordPress · Log in