• 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

ADOBE Aptitude C Language Test

Check Binary Tree is Binary Search Tree or not

Amazon Interview Experience – SDE Chennai

Sequence Finder Dynamic Programming

Reliance Jio Software Developer Interview Experience

HackeEarth Flipkart’s Drone

Check if an array has duplicate numbers in O(n) time and O(1) space

SAP Off Campus Hiring_ March 2015 Computer Skills

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

Length of the longest substring without repeating characters

DFS (Depth First Search)

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Reversal of LinkedList

VMWare SDEII Interview

Naurki.com Security Breach

Printing each word reverse in string

Find the kth number with prime factors 3, 5 and 7

Reverse a Linked List in groups of given size

Binary Tree in Java

Binary Tree in Java

Convert number to words java

LeetCode : Word Search

Find if a binary tree is height balanced ?

Find Pythagorean Triplets in an array in O(N)

Binary Tree Isomorphic to each other

Flipkart SDET Interview Experience

strtok()

Microsoft BING Interview Experience

Count Possible Decodings of a given Digit Sequence

Connect n ropes with minimum cost

Copyright © 2026 · Genesis Framework · WordPress · Log in