• 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

System Design: Designing a LLD for Hotel Booking

Templates in C++

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

Amazon Interview On-Campus For Internship – 1

Serialise Deserialise N-ary Tree

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

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

The Magic HackerEarth Nirvana solutions Hiring Challenge

Diagonal Traversal of Binary Tree

Maximum size of square sub matrix with all 1’s in a binary matrix

Printing intermediate Integers between one element & next element of array

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

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

Microsoft BING Interview Experience

LeetCode : Word Search

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

strtok()

Word Break Problem

Python String and numbers

Introduction To Number Theory ( Part 1 )

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

Adobe Interview Questions 8 month Exp

SAP Off Campus Hiring_ March 2015 Sample Questions

Best Java Book | Top Java Programming Book for Beginners

Printing Longest Common Subsequence

Binary Tree Isomorphic to each other

Print all nodes that are at distance k from a leaf node

Binary Tree in Java

Maximum path sum between two leaves

SAP Off Campus Hiring_ March 2015 Computer Skills

Copyright © 2025 · Genesis Framework · WordPress · Log in