• 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

BlueStone E-commerce Interview Experience

Memory Efficient LinkedList

Add Sub Multiply very large number stored as string

SAP Hiring Off-Campus General Aptitude

Printing each word reverse in string

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

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Longest Increasing Subsequence

Client Server C program

BFS (Breath First Search)

The Magic HackerEarth Nirvana solutions Hiring Challenge

Possible sizes of bus to carry n groups of friends

SAP Off Campus Hiring_ March 2015 Computer Skills

LeetCode: Binary Tree Maximum Path Sum

Subset Sum Problem Dynamic programming

Code Chef PRGIFT Solution

System Design: Designing a LLD for Hotel Booking

Stock Buy Sell to Maximize Profit

Microsoft BING Interview Experience

Binary Tree Isomorphic to each other

1014 Practice Question of New GRE – Princeton

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

Apriori algorithm C Code Data Mining

Level order traversal in Spiral form

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

Maximum sum contiguous subarray of an Array

Python Dictionaries

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

Fibonacci Hashing & Fastest Hashtable

strtok()

Copyright © 2026 · Genesis Framework · WordPress · Log in