• 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

Daughter’s Age VeryGood Puzzle

Longest Increasing Subsequence

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

Calculate price of parking from parking start end time prices

flattens 2 D linked list to a single sorted link list

Templates in C++

Client Server C program

C++ OOPs Part2

TicTacToe Game As Asked in Flipkart

Leetcode: Edit Distance

Coin Collection Dynamic Programming

Printing intermediate Integers between one element & next element of array

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

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Regular Expression Matching

Test Cases for Round Function

Generate next palindrome number

LeetCode: Container With Most Water

Advanced SQL Injection

Word Break Problem

Maximum sum contiguous subarray of an Array

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

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

Python String and numbers

Serialise Deserialise N-ary Tree

C Program for TAIL command of UNIX

Number of Islands BFS/DFS

Find two non repeating elements in an array of repeating elements

Get Minimum element in O(1) from input numbers or Stack

Diagonal Traversal of Binary Tree

Copyright © 2026 · Genesis Framework · WordPress · Log in