|
This post is completed by 2 users
|
Add to List |
37. Get the Height of a Node in a Binary Tree
Objective: Given a binary tree, find the height of a given node in the tree.
Example:
Approach - Recursion:
- Take a variable called height=0.
- Search for that given node in the tree using recursion.
- Each time you go left or right, increase the height by 1.
- Once you found the given node, return the height.
- If tree is over and the element is not found, return 0
Output
Height of the Node 25 is : 3