• 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

Find and print longest consecutive number sequence in a given sequence in O(n)

C++ OOPs Part2

Right view of Binary tree

VMWare SDEII Interview

BlueStone E-commerce Interview Experience

SAP Hiring Off-Campus General Aptitude

Printing each word reverse in string

Best Java Book | Top Java Programming Book for Beginners

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Given a float number convert it into the string WITHOUT using any inbuilt Function

C++ OOPs Part1

Given a sorted array and a number x, find the pair in array whose sum is closest to x

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

BFS (Breath First Search)

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Binary Tree Isomorphic to each other

Sort an array according to the order defined by another array

Find the kth number with prime factors 3, 5 and 7

Flipkart Set 1 On Campus with Answers

Binary Tree in Java

Find two non repeating elements in an array of repeating elements

Advanced SQL Injection

Find the number ABCD such that when multipled by 4 gives DCBA.

Get K Max and Delete K Max in stream of incoming integers

Find Percentage of Words matching in Two Strings

Printing intermediate Integers between one element & next element of array

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

Stickler thief

Subset Sum Problem Dynamic programming

Copyright © 2026 · Genesis Framework · WordPress · Log in