This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Beginner

Given a binary tree, Convert it into its Mirror Tree

Objective: Given a binary tree, Convert it into its Mirror Tree

Mirror Tree: Mirror Tree of a binary tree is where left and right child of every node of given binary tree is interexchanged.

Input: A binary tree.

Example:

Approach:

• Do the PreOrder Traversal.
• Starting from the root, swap the left and right childs.
• Recursively call the same procedure in the leftsubtree and right subtree.

Run This Code

Code:

Output:

1 2 3 4 5 6 7
 Mirror Image  7 6 5 4 3 2 1

---

---

Also Read:

- Print All The Nodes Which are X distance from the Leaf Nodes Medium
- Level Order Traversal, Print each level in separate line. Medium
- Check If Given Undirected Graph is a tree Medium
- Make a Binary Tree from Given Inorder and Preorder Traveral. Hard
- Print the Bottom View of the Binary Tree. Medium
- Lowest Common Ancestor in a Binary Search Tree. Medium
- Diameter Of a Binary Tree Hard
- Binary Min-Max Heap Implementation Hard

---