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:

- All Paths from Top Left to Bottom Right in 2D Array Medium
- Calculate Distance Between Nodes in a Binary Tree Hard
- Generate Well Ordered Passwords of a Given Length K Medium
- Convert a Sorted Doubly Linked List to Balanced BST Medium
- Generate all the strings of length n from 0 to k-1 Medium