• 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

Convert number to words java

Stock Buy Sell to Maximize Profit

simple sql injection

Longest Increasing Subsequence

Count Possible Decodings of a given Digit Sequence

Linked List V/S Binary Search Tree

K’th Largest Element in BST when modification to BST is not allowed

Doubly linked list

Find loop in Singly linked list

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Test Cases for Round Function

flattens 2 D linked list to a single sorted link list

Find Nearest Minimum number in left side in O(n)

Practo Hiring Experience

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

Amazon Interview On-Campus For Internship – 1

Daughter’s Age VeryGood Puzzle

Right view of Binary tree

Find Percentage of Words matching in Two Strings

SAP Off Campus Hiring_ March 2015 Sample Questions

Level order traversal in Spiral form

HackeEarth Flipkart’s Drone

Add Sub Multiply very large number stored as string

Microsoft BING Interview Experience

Coin Collection Dynamic Programming

DFS (Depth First Search)

Singly linked list

Apriori algorithm C Code Data Mining

Printing intermediate Integers between one element & next element of array

TicTacToe Game As Asked in Flipkart

Copyright © 2026 · Genesis Framework · WordPress · Log in