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:

- AVL Tree - Insertion Hard
- Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Beginner
- Reverse a Linked List Beginner
- Number of Islands using BFS Medium
- Print The Top View of a Binary Tree Medium
- Level Order Traversal, Print each level in separate line. Medium
- Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard
- Determine whether given binary tree is binary search tree(BST) or not Medium