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
- 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)
Height of the Tree is 7
Top Companies Interview Questions..-
If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.