Find the Deepest Node in a Binary Tree.

Objective: - Given a binary tree, write an algorithm to Find the deepest node in it.

Approach:

1. Take two global variables as "deepestlevel" and "value".
2. starting with level=0, Do the inorder traversal and whenever you go down one level ( root.left OR root.right), increase the level by 1.
3. Keep checking if deepestlevel < level, if yes then update the "deepestlevel " and "value ".
4. At the end return "value", which will be the deepest node value.
5. See the code for a better explanation.

Run This Code

Code:

Deepest child is: 8

Also Read:

- Convert BST to Greater Sum Tree Medium
- Given a binary tree, find out the maximum sum of value from root to each leaf. Medium
- In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard
- Graph – Depth First Search using Recursion Beginner
- Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium
- Towers Of Hanoi Beginner
- Check If Given Undirected Graph is a tree Medium
- Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard