Minimum Depth Binary Tree Problem
Published in
Nov 11, 2023
Given the root of a binary tree, return the minimum depth of the binary tree. The minimum depth is the total number of nodes along the shortest path in binary tree from the root node down to the nearest leaf node.
Input:
Output: 3
Explanation: The shortest path is 1 → 3 → 6.
Practice link: https://www.techiedelight.com/?problem=MinimumDepthBinaryTree