• 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

Password Predictor

Count Possible Decodings of a given Digit Sequence

Memory Efficient LinkedList

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

Walmart Labs Interview Experience

Maximum path sum between two leaves

Possible sizes of bus to carry n groups of friends

Find Percentage of Words matching in Two Strings

Sort Stack in place

SAP Interview Questions

Connect n ropes with minimum cost

Printing Longest Common Subsequence

Right view of Binary tree

Implement a generic binary search algorithm for Integer Double String etc

Circular Linked List

Find Pythagorean Triplets in an array in O(N)

Flipkart SDET Interview Experience

HackeEarth Flipkart’s Drone

Number of Islands BFS/DFS

Apriori algorithm C Code Data Mining

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

Find if two rectangles overlap

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

How strtok() Works

Adobe Interview Questions 8 month Exp

BlueStone E-commerce Interview Experience

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

Add Sub Multiply very large number stored as string

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

SAP Off Campus Hiring_ March 2015 Computer Skills

Copyright © 2025 · Genesis Framework · WordPress · Log in