LeetCode-111.Mininum 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],

return its minimum depth = 2.

 1 public int minDepth(TreeNode root) {//树 递归 mytip
 2         if(null==root){
 3             return 0;
 4         }
 5         int left = minDepth(root.left);
 6         int right = minDepth(root.right);
 7         int d=left>right?(right+1):(left+1);
 8         if(left==0||right==0){//注意 单孩子的判断
 9             d= left+right+1;
10         }
11         return d;
12     }

还可以使用BFS的方法

LeetCode-111.Mininum Depth of Binary Tree

公告