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:

- Find all unique combinations of numbers (from 1 to 9 ) with sum to N Medium
- Double Threaded Binary Tree Complete Implementation Hard
- Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard
- Construct a binary tree from given Inorder and Level Order Traversal Hard
- Merge Sort - Updated - Most Efficient ways to Implement Medium
- Binary Tree-Inorder Traversal - Non Recursive Approach Beginner
- Diameter Of a Binary Tree Hard
- Construct a binary tree from given Inorder and Postorder Traversal Hard