Given a complete binary tree of depth H. If the mirror image from the left and the right side of this tree is taken then:
Right Mirrored Image: Rightmost node of the every level is connected to mirrored corresponding node.
Left Mirrored Image: Left most node of the every level is connected to mirrored corresponding node.
The task is to find the number of edges after taking both the mirror images in the final tree.
Input: H = 1
2 edges in the original tree will get mirrored in the mirror images (left and right) i.e. 6 edges in total.
And the edges connecting the mirror images with the original tree as shown in the image above.
Input: H = 2
(6 * 3) + 3 + 3 = 24
Approach: Maintain the leftmost, rightmost nodes after each mirror image. Number of edges will change after each operation of mirror image. Initially,
After right mirrored image:
After left mirrored image:
In complete modified tree:
Below is the implementation of the above approach:
- Sum of the mirror image nodes of a complete binary tree in an inorder way
- Number of edges in a perfect binary tree with N levels
- Symmetric Tree (Mirror Image of itself)
- Create a mirror tree from the given binary tree
- Convert a Binary Tree into its Mirror Tree
- Check whether a binary tree is a complete tree or not | Set 2 (Recursive Solution)
- Find mirror of a given node in Binary tree
- Linked complete binary tree & its creation
- Height of a complete binary tree (or Heap) with N nodes
- Check whether a given Binary Tree is Complete or not | Set 1 (Iterative Solution)
- Find the largest Complete Subtree in a given Binary Tree
- Iterative Boundary traversal of Complete Binary tree
- Construct Complete Binary Tree from its Linked List Representation
- Print path from root to all nodes in a Complete Binary Tree
- Check if value exists in level-order sorted complete binary tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.