Question: 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

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. A leaf is a node with no children. Note: You are required to add comments to your code submissions Example: Given binary tree [3,9,20,null,null,15,7], 9 20 15 7 return its minimum depth2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
