Minimum Depth of Binary Tree
Tree BFS
Problem
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
Note: A leaf is a node with no children.
When we come across a leaf node, then this level will represent the minimum depth
Solution
Last updated