• 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

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Find if a binary tree is height balanced ?

Walmart Labs Interview Experience

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

Microsoft BING Interview Experience

Find the element that appears once others appears thrice

Closed Parentheses checker

Common Ancestor in a Binary Tree or Binary Search Tree

Stickler thief

SAP Hiring Off-Campus General Aptitude

Test Cases for Round Function

Daughter’s Age VeryGood Puzzle

Knight Tour Problem (Graph – Breadth First Search)

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Level order traversal in Spiral form

Urban Ladder Written Test.

Serialise Deserialise N-ary Tree

Printing each word reverse in string

Trapping Rain Water

Check Binary Tree is Binary Search Tree or not

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

Sort an array according to the order defined by another array

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

Reverse a Linked List in groups of given size

Python Array String

Print all nodes that are at distance k from a leaf node

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Memory Efficient LinkedList

Difference between a LinkedList and a Binary Search Tree BST

BFS (Breath First Search)

Copyright © 2025 · Genesis Framework · WordPress · Log in