• 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

1014 Practice Question of New GRE – Princeton

LeetCode: Binary Tree Maximum Path Sum

SAP Off Campus Hiring_ March 2015 Sample Questions

Microsoft BING Interview Experience

CodeChef Code SGARDEN

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

Client Server C program

ADOBE Aptitude C Language Test

Length of the longest substring without repeating characters

Implement a generic binary search algorithm for Integer Double String etc

Right view of Binary tree

strtok()

HackeEarth Flipkart’s Drone

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Trapping Rain Water

The Magic HackerEarth Nirvana solutions Hiring Challenge

Flipkart Set 1 On Campus with Answers

Binary Tree in Java

Find the element that appears once others appears thrice

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

Knight Tour Problem (Graph – Breadth First Search)

Facebook Interview Question : Interleave List

Advanced SQL Injection

Maximum occurred Smallest integer in n ranges

Possible sizes of bus to carry n groups of friends

Templates in C++

Print Power Set of a Set

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

Best Java Book | Top Java Programming Book for Beginners

BlueStone E-commerce Interview Experience

Copyright © 2026 · Genesis Framework · WordPress · Log in