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.

Input: A Binary Tree and a node

Output: 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 left or right , increase the height by 1.
• Once you found the given node, return the height.
• If till the end you do not find the node, return 0

Run This Code

Code:

Output

 :
Height of the Node 25 is : 3

Also Read:

- Find the n'th Node from the end of a given Linked List Beginner
- Print All Nodes Between Two Given Levels Medium
- Backtracking - SUDOKU Solver Hard
- Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium
- Find whether a Given Binary Tree is Balanced? Medium
- Merge Sort in a Linked list Medium
- Reverse a Linked List - Part 2 Beginner
- All N Length Strings from Given String of Length K Medium