• 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

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

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

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

Cisco Hiring Event 21st – 22nd Feb 2015

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

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

Urban Ladder Written Test.

Flipkart SDET Interview Experience

Python Array String

Print Power Set of a Set

Python Dictionaries

simple sql injection

LeetCode : Word Search

Possible sizes of bus to carry n groups of friends

FizzBuzz Solution C C++

Stickler thief

Max Sum in circularly situated Values

VMWare SDEII Interview

Python List

Common Ancestor in a Binary Tree or Binary Search Tree

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

Linked List V/S Binary Search Tree

Amazon Interview On-Campus For Internship – 1

SAP Off Campus Hiring_ March 2015 Verbal Skills

Find Percentage of Words matching in Two Strings

Find min element in Sorted Rotated Array (With Duplicates)

CodeChef Code SGARDEN

flattens 2 D linked list to a single sorted link list

25 horses 5 tracks Find 3 fastest puzzle

Edit Distance ( Dynamic Programming )

Copyright © 2026 · Genesis Framework · WordPress · Log in