• 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 min element in Sorted Rotated Array (With Duplicates)

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

Connect n ropes with minimum cost

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

Level order traversal in Spiral form

Printing Longest Common Subsequence

Check Binary Tree is Binary Search Tree or not

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

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

Edit Distance ( Dynamic Programming )

Adobe Interview Questions 8 month Exp

Max Sum in circularly situated Values

Sort Stack in place

Binary Tree in Java

Check if an array has duplicate numbers in O(n) time and O(1) space

Trapping Rain Water

Minimum insertions to form a palindrome

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

Sort an array according to the order defined by another array

Find if a binary tree is height balanced ?

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

How Radix sort works

Word Break Problem

Introduction To Number Theory ( Part 1 )

Reversal of LinkedList

simple sql injection

BFS (Breath First Search)

SAP Off Campus Hiring_ March 2015 Computer Skills

System Design: Designing a LLD for Hotel Booking

Maximum occurred Smallest integer in n ranges

Copyright © 2026 · Genesis Framework · WordPress · Log in