• 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

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

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

BFS (Breath First Search)

LeetCode: Binary Tree Maximum Path Sum

Find min element in Sorted Rotated Array (Without Duplicates)

Convert number to words java

Find min element in Sorted Rotated Array (With Duplicates)

Word Break Problem

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

Stickler thief

SAP Hiring Off-Campus General Aptitude

How Radix sort works

Hackerearth : Counting Subarrays

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

Longest Increasing Subsequence

Best Java Book | Top Java Programming Book for Beginners

The Magic HackerEarth Nirvana solutions Hiring Challenge

Trie Dictionary

Flipkart Set 1 On Campus with Answers

Reliance Jio Software Developer Interview Experience

Diagonal Traversal of Binary Tree

CodeChef’ RRCOPY

C++ OOPs Part1

Amazon Interview On-Campus For Internship – 1

Printing intermediate Integers between one element & next element of array

Client Server C program

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

TicTacToe Game As Asked in Flipkart

Printing each word reverse in string

Maximum sum contiguous subarray of an Array

Copyright © 2025 · Genesis Framework · WordPress · Log in