Find the Maximum Depth OR Height of a Binary Tree

Objective: Given a binary tree, find the height of it

Input: A Binary Tree

Output: Height of a binary tree

Example:

Tree Height - Example

Approach:

       Recursion:

  • Get the height of left sub tree, say leftHeight
  • Get the height of right sub tree, say rightHeight
  • Take the Max(leftHeight, rightHeight) and add 1 for the root and return
  • Call recursively.

Time Complexity : O(n)

get Height of a tree - Recursion

Complete Code:

Output:

Height of the Tree is 7

4 thoughts on “Find the Maximum Depth OR Height of a Binary Tree”

  1. The height of a single-node tree is zero by definition, not one. You should check if your root has any children before adding 1 to the height.

    Reply
    • public int treeHeight(Node root){
      if(root==null)return -1;
      return (1+ Math.max(treeHeight(root.left),treeHeight(root.right)));
      }

      This would work

      Reply

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.