Height of a Binary Tree

Given a binary tree, write a method to find its height recursively.
An empty tree has a height of 0.

Example:  
     1
    / \
   2   3     ==> height=3
  / \ / \
 4  5 6  7

Need a hand? Try out these hints, one at a time.

Quick hint to get things rolling

Height of a binary tree is the number of nodes in the longest path from the root to its deepest node.

A more detailed explanation

The key here is to find the depth of left and right subtrees.

Height of the binary tree will be the maximum of the two heights plus one, to account for the root.

Final hint! You should be able to code the problem on viewing this.

1. If the root is null, return 0.
2. Find the height of the left subtree by calling findHeight(root.left).
3. Find the height of the right subtree by calling findHeight(root.right)
4. Compare the two heights and return the maximum of the two (after adding 1 to account for the root node).

public int findHeight(TreeNode root) { 
    


}

This Coding Interview Question is available with an answer in the following programming languages :

Java

Python

Height of a Binary Tree

Quick hint to get things rolling

A more detailed explanation

Final hint! You should be able to code the problem on viewing this.

The interview prep tool you'll fall in love with!

This Coding Interview Question is available with an answer in the following programming languages :