Skip to content

Latest commit

 

History

History

Minimum Depth of N-ary Tree

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
README.md
README.md
 
 
mindepth.cpp
mindepth.cpp
 
 

README.md

Minimum Depth of N-ary Tree

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.

Example 1:

Input: root = [3,9,20,null,null,15,7]
Output: 2

Constraints:

  • The number of nodes in the tree is in the range [0, 105].
  • -1000 <= Node.val <= 1000