• 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

Binary Tree in Java

Generate next palindrome number

Max Sum in circularly situated Values

Check Binary Tree is Binary Search Tree or not

Subset Sum Problem Dynamic programming

Maximum of all subarrays of size k

Doubly linked list

Connect n ropes with minimum cost

Wrong Directions given find minimum moves so that he can reach to the destination

Daughter’s Age VeryGood Puzzle

strtok()

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

BlueStone E-commerce Interview Experience

How strtok() Works

Interfaces in C++ (Abstract Classes in C++)

CodeChef’ RRCOPY

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

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

Word Break Problem

Urban Ladder Written Test.

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

The Magic HackerEarth Nirvana solutions Hiring Challenge

System Design: Designing a LLD for Hotel Booking

Find Nearest Minimum number in left side in O(n)

Sort an array according to the order defined by another array

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Spanning Tree

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Best Java Book | Top Java Programming Book for Beginners

Generate largest number arranging a no. of given non negative integer numbers

Copyright © 2026 · Genesis Framework · WordPress · Log in