Be the first user to complete this post

Add to List 
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
Code:
Output
: Height of the Node 25 is : 3
Also Read: