树：1.求给定二叉树的最小深度

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
//深度遍历优先（DFS）递归/栈
public class Solution {
    public int run(TreeNode root) {
        if(root==null){
            return 0;
        }
      int l= run(root.left);
      int r=run(root.right);
      if(l==0||r==0){
       return l+r+1;
        }
      return (Math.min(l,r)+1);
}
}
//广度遍历优先（BFS）队列
public class Solution {
    public int run(TreeNode root) {
        if(root==null){
            return 0;
        }
            
        LinkedList<TreeNode> queue=new LinkedList<TreeNode>();
        LinkedList<TreeNode> layer=new LinkedList<TreeNode>();
        queue.addFirst(root);
        int start=0;
        int end =1;
        int level=1;
        while(!queue.isEmpty()){
          TreeNode temp=queue.removeLast();
            start++;
            layer.addFirst(temp);
            if(temp.left==null&&temp.right==null){
                return level;
            }
            if(temp.left!=null){
                queue.addFirst(temp.left);
            }
            if(temp.right!=null){
                queue.addFirst(temp.right);
            }
            if(end==start){
                level++;
                start=0;
                end=queue.size();
                layer=new LinkedList<TreeNode>();
            }
        }
        return level;
}
}