• 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

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

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

Code Chef PRGIFT Solution

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

CodeChef’ RRCOPY

Spanning Tree

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

flattens 2 D linked list to a single sorted link list

DFS (Depth First Search)

Length of the longest substring without repeating characters

Find next greater number with same set of digits

Printing Longest Common Subsequence

Adobe Interview Questions 8 month Exp

Singly linked list

Skiing on Mountains Matrix

Calculate price of parking from parking start end time prices

Sort Stack in place

Flipkart SDET Interview Experience

Leetcode: Merge Intervals

System Design: Designing a LLD for Hotel Booking

Interfaces in C++ (Abstract Classes in C++)

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Amazon Interview On-Campus For Internship – 1

1014 Practice Question of New GRE – Princeton

LeetCode: Container With Most Water

Add Sub Multiply very large number stored as string

Find min element in Sorted Rotated Array (Without Duplicates)

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

Memory Efficient LinkedList

CodeChef Code SGARDEN

Copyright © 2025 · Genesis Framework · WordPress · Log in