111.minimum depth of binary tree(E)

发布时间：2020-12-14 04:16:20 所属栏目：大数据来源：网络整理

导读：111 . minimum depth of binary tree ? 111 . minimum depth of binary treeGiven 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 lea

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,15,7],3
   /   9  20
    /     15   7
return its minimum depth = 2.

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!