• 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

Subset Sum Problem Dynamic programming

Client Server C program

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

SAP Off Campus Hiring_ March 2015 Computer Skills

Advanced SQL Injection

Fibonacci Hashing & Fastest Hashtable

Find if a binary tree is height balanced ?

25 horses 5 tracks Find 3 fastest puzzle

Diagonal Traversal of Binary Tree

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

Check if an array has duplicate numbers in O(n) time and O(1) space

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Flipkart Set 1 On Campus with Answers

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

LeetCode: Container With Most Water

Sort an array according to the order defined by another array

Convert number to words java

Number of Islands BFS/DFS

Max Sum in circularly situated Values

Printing each word reverse in string

Sort Stack in place

Print vertical sum of all the axis in the given binary tree

Maximum occurred Smallest integer in n ranges

TicTacToe Game As Asked in Flipkart

Difference between a LinkedList and a Binary Search Tree BST

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

Get K Max and Delete K Max in stream of incoming integers

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

Given a float number convert it into the string WITHOUT using any inbuilt Function

Maximum size of square sub matrix with all 1’s in a binary matrix

Copyright © 2025 · Genesis Framework · WordPress · Log in