• 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

Minimum insertions to form a palindrome

Fibonacci Hashing & Fastest Hashtable

SAP Off Campus Hiring_ March 2015 Sample Questions

Find if two rectangles overlap

LeetCode : Word Search

flattens 2 D linked list to a single sorted link list

Leetcode: Merge Intervals

Possible sizes of bus to carry n groups of friends

Maximum of all subarrays of size k

Find next greater number with same set of digits

TicTacToe Game As Asked in Flipkart

Amazon Interview Experience – SDE Chennai

Binary Tree in Java

C++ OOPs Part2

SAP Hiring Off-Campus General Aptitude

Hackerearth : Counting Subarrays

Urban Ladder Written Test.

Binary Tree in Java

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

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Find Percentage of Words matching in Two Strings

Find min element in Sorted Rotated Array (Without Duplicates)

Walmart Labs Interview Experience

VMWare SDEII Interview

Reliance Jio Software Developer Interview Experience

CodeChef Code SGARDEN

Advanced SQL Injection

Flipkart SDET Interview Experience

ADOBE Aptitude C Language Test

Diagonal Traversal of Binary Tree

Copyright © 2026 · Genesis Framework · WordPress · Log in