• 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

Find and print longest consecutive number sequence in a given sequence in O(n)

Reliance Jio Software Developer Interview Experience

Subset Sum Problem Dynamic programming

Find two non repeating elements in an array of repeating elements

FizzBuzz Solution C C++

flattens 2 D linked list to a single sorted link list

Implement a generic binary search algorithm for Integer Double String etc

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

Regular Expression Matching

Doubly linked list

Python Array String

Leetcode: Merge Intervals

Flipkart Set 1 On Campus with Answers

Hackerearth : Counting Subarrays

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

Advanced SQL Injection

Trapping Rain Water

Find loop in Singly linked list

Check Binary Tree is Binary Search Tree or not

Stickler thief

Possible sizes of bus to carry n groups of friends

Facebook Interview Question : Interleave List

Leetcode: Edit Distance

Get Minimum element in O(1) from input numbers or Stack

ADOBE Aptitude C Language Test

1014 Practice Question of New GRE – Princeton

Walmart Labs Interview Experience

How Radix sort works

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

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

Copyright © 2026 · Genesis Framework · WordPress · Log in