Find the height of the binary tree given that only the nodes on the even levels are considered as the valid leaf nodes.
The height of a binary tree is the number of edges between the tree’s root and its furthest leaf. But what if we bring a twist and change the definition of a leaf node. Let us define a valid leaf node as the node that has no children and is at an even level (considering root node as an odd level node).
Output :Height of tree is 4
Solution : The approach to this problem is slightly different from the normal height finding approach. In the return step, we check if the node is a valid root node or not. If it is valid, return 1, else we return 0. Now in the recursive step- if the left and the right sub-tree both yield 0, the current node yields 0 too, because in that case there is no path from current node to a valid leaf node. But in case at least one of the values returned by the children is non-zero, it means the leaf node on that path is a valid leaf node, and hence that path can contribute to the final result, so we return max of the values returned + 1 for the current node.
Height of tree is 4
Time Complexity:O(n) where n is number of nodes in given binary tree.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Print middle level of perfect binary tree without finding height
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Difference between sums of odd level and even level nodes of a Binary Tree
- Find sum of all right leaves in a given Binary Tree
- Minimum sum path between two leaves of a binary tree
- Find sum of all left leaves in a given Binary Tree
- Print all nodes in a binary tree having K leaves
- Find the maximum path sum between two leaves of a binary tree
- Extract Leaves of a Binary Tree in a Doubly Linked List
- Check if a given Binary Tree is height balanced like a Red-Black Tree
- Tree with N nodes and K leaves such that distance between farthest leaves is minimized
- Check if max sum level of Binary tree divides tree into two equal sum halves
- Given level order traversal of a Binary Tree, check if the Tree is a Min-Heap
- How to determine if a binary tree is height-balanced?
- Iterative Method to find Height of Binary Tree
- Relationship between number of nodes and height of binary tree
- Height of a complete binary tree (or Heap) with N nodes
- Find Height of Binary Tree represented by Parent array
- Print the nodes of the Binary Tree whose height is a Prime number
- Sum of all nodes at Kth level in a 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.