leetcode打卡04——二叉树最小深度

题目：给定一个二叉树，找出其最小深度。最小深度是从根节点到最近叶子节点的最短路径上的节点数量。
说明: 叶子节点是指没有子节点的节点。

层次遍历，每当遍历完一层的节点，deep++，当遍历到某层的叶子节点时，返回当前的deep。变量的作用及细节讲解参考：https://blog.csdn.net/qq_41934760/article/details/105689903

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int minDepth(TreeNode root) {
        TreeNode point=root;
        int deep=1;
        int p=0,q=0;
        TreeNode lastnode=root,newlast=root;
        ArrayList<TreeNode> list=new ArrayList<>();
        
        if(point==null){
            return 0;
        }//树为空，返回0层
        list.add(point);
        p++;
        while(p!=q){
            point=list.get(q);
            q++;
            if(point.left==null&&point.right==null){
                return deep;
            }
            if(point.left!=null){
                //point=point.left;
                list.add(point.left);
                newlast=point.left;
                p++;
            }
            if(point.right!=null){
                list.add(point.right);
                newlast=point.right;
                p++;
            }
            if(point.equals(lastnode)){
                lastnode=newlast;
                deep++;
            }
        }
      throw new IllegalArgumentException("is null");//传入非法参数时抛出异常
    }