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:

Approach:

       Recursion:

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)

Run This Code

Code:

Height of the Tree is 7

Also Read:

- Print all subarrays using recursion Medium
- Find the Height of a tree without using Recursion Medium
- Print the Vertical Sum in binary Tree Medium
- Euclidean algorithm - Greatest Common Divisor(GCD) Beginner
- Diameter Of a Binary Tree Hard
- Backtracking - N Queens Problem Hard
- Graph – Depth First Search using Recursion Beginner
- Sorted Array to Binary Search Tree of Minimal Height Medium