• 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

Generate largest number arranging a no. of given non negative integer numbers

BlueStone E-commerce Interview Experience

How Radix sort works

Check Binary Tree is Binary Search Tree or not

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Walmart Labs Interview Experience

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

Handle duplicates in Binary Search Tree

LeetCode: Binary Tree Maximum Path Sum

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

ADOBE Aptitude C Language Test

SAP Interview Questions

Word Break Problem

SAP Off Campus Hiring_ March 2015 Computer Skills

Daughter’s Age VeryGood Puzzle

The greedy coins game Dynamic Programming

Find Percentage of Words matching in Two Strings

Flipkart Set 1 On Campus with Answers

Find if two rectangles overlap

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Sort Stack in place

Subset Sum Problem Dynamic programming

Leetcode: Merge Intervals

Introduction To Number Theory ( Part 1 )

Closed Parentheses checker

Maximum difference between two elements s.t larger element appears after the smaller number

Maximum of all subarrays of size k

Advanced SQL Injection

Python String and numbers

Reverse a Linked List in groups of given size

Copyright © 2026 · Genesis Framework · WordPress · Log in