• 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

VMWare Openings

Given a string, find the first character which is non-repetitive

Flipkart Set 1 On Campus with Answers

Practo Hiring Experience

Printing Longest Common Subsequence

Reverse a Linked List in groups of given size

Daughter’s Age VeryGood Puzzle

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

Python List

Sequence Finder Dynamic Programming

Doubly linked list

Implement LRU Cache

Binary Tree in Java

Fibonacci Hashing & Fastest Hashtable

Amazon Interview On-Campus For Internship – 1

SAP Off Campus Hiring_ March 2015 Sample Questions

LeetCode: Binary Tree Maximum Path Sum

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

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

Binary Tree in Java

Max Sum in circularly situated Values

Maximum occurred Smallest integer in n ranges

C Program for TAIL command of UNIX

25 horses 5 tracks Find 3 fastest puzzle

Circular Linked List

Stickler thief

Diagonal Traversal of Binary Tree

SAP Interview Questions

CodeChef Code SGARDEN

Find the smallest window in a string containing all characters of another string

Copyright © 2026 · Genesis Framework · WordPress · Log in