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:

• 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)

Run This Code

Code:

Height of the Tree is 7

Also Read:

- Print Left View of a given binary tree Medium
- Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Medium
- Convert binary tree to its Sum tree Medium
- Find the number of distinct Islands OR connected components. Hard
- Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium
- Dynamic Programming - Longest Common Subsequence Medium
- Find the Size of the Binary Tree Beginner
- Merge Sort - Updated - Most Efficient ways to Implement Medium