This post is completed by 3 users

  • 1
Add to List

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


Tree Height - Example



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

Time Complexity : O(n)

get Height of a tree - Recursion


Height of the Tree is 7

Also Read: