FunctionRacerProblemsRace

Minimum Depth of Binary Tree

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. The minimum depth is the number of nodes on the shortest path from the root down to a leaf (a node with no children). A node with only one child is not a leaf. An empty tree gives 0.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [3,9,20,null,null,15,7]
returns 2

Root to 9 passes through 2 nodes.

Example 2

root [2,null,3,null,4]
returns 3

The only leaf is 4, three nodes down.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems