**Objective: -** Given a binary tree, Find the deepest node in it.

**Approach: **

- Take two global variable as “
” and “*deepestlevel*”.*value* - starting with
=0, Do the inorder traversal and whenever you go down one level ( root.left OR root.right), increase the level by 1.*level* - Keep checking if
, if yes then update the “*deepestlevel < level*” and “*deepestlevel*“.*value* - At the end return “
”, which will the deepest node value.*value* - See the code for better explanation.

**Code:**

**Output**:

Deepest child is: 8