111.minimum depth of binary tree(E)

Posted guxuanqing

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了111.minimum depth of binary tree(E)相关的知识，希望对你有一定的参考价值。

111. minimum depth of binary tree

 

111. minimum depth of binary 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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

    3
   /   9  20
    /     15   7
return its minimum depth = 2.

 

以上是关于111.minimum depth of binary tree(E)的主要内容，如果未能解决你的问题，请参考以下文章