# 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:

Get The Height Of a Node

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 wont find the node, return 0

Complete Code:

```Output :
Height of the Node 25 is : 3
```

__________________________________________________
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.
__________________________________________________

#### You may also like...

• sunny kansal

There’s something not correct. Height of Node x => 25 should be 1 not 3. Can you check it please?

• tutorialhorizon

We are considering the height here as number of nodes above the particular node (including the node itself)

• sunny kansal

Still output and solution is wrong…Height of Node is the longest path till its leaf node…And it should be 1 for Node 25 not 3…but the number of levels are 3…