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:

1. Take a variable called height=0.
2. Search for that given node in the tree using recursion.
3. Each time you go left or right, increase the height by 1.
4. Once you found the given node, return the height.
5. If tree is over and the element is not found, return 0

Output

Height of the Node 25 is : 3

Related Problems:

- Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard
- Print all subarrays using recursion Medium
- Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium
- In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard
- The Word Break Problem Hard