• 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

Generic Object Oriented Stack with Template

CodeChef Code SGARDEN

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

Right view of Binary tree

Print Power Set of a Set

Regular Expression Matching

Longest Increasing Subsequence

Subset Sum Problem Dynamic programming

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

Find loop in Singly linked list

Find position of the only set bit

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

Closed Parentheses checker

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

Count Possible Decodings of a given Digit Sequence

Password Predictor

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

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

Linked List V/S Binary Search Tree

Flipkart Set 1 On Campus with Answers

Python Dictionaries

Leetcode: Edit Distance

Check Binary Tree is Binary Search Tree or not

Search element in a matrix with all rows and columns in sorted order

Reverse a Linked List in groups of given size

Amazon Interview Experience – SDE Chennai

Introduction To Number Theory ( Part 1 )

The Magic HackerEarth Nirvana solutions Hiring Challenge

simple sql injection

ADOBE Aptitude C Language Test

Copyright © 2025 · Genesis Framework · WordPress · Log in