广度优先获取二叉树最小深度

    static class TreeNode{
        private int val;
        private TreeNode left;
        private TreeNode right;
        private int deep;

        public TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }

        @Override
        public String toString() {
            return "TreeNode{" +
                    "val=" + val +
                    ", left=" + left +
                    ", right=" + right +
                    '}';
        }
    }

    public static void main(String[] args) {
        TreeNode node7 = new TreeNode(7, null, null);
        TreeNode node6 = new TreeNode(6, node7, null);
        TreeNode node5 = new TreeNode(5, null, null);
        TreeNode node4 = new TreeNode(4, null, null);
        TreeNode node3 = new TreeNode(3, node6, null);
        TreeNode node2 = new TreeNode(2, node4, node5);
        TreeNode node1 = new TreeNode(1, node2, node3);
        System.out.println(minDepth1(node1));
        
}


    //广度优先获取二叉树最小深度
    private static int minDepth1(TreeNode node1) {
        if (node1 == null) {
            return 0;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        node1.deep = 1;
        queue.offer(node1);
        while (!queue.isEmpty()) {
            TreeNode poll = queue.poll();
            if (poll.left == null && poll.right == null) {
                return poll.deep;
            }
            if (poll.left != null) {
                poll.left.deep = poll.deep + 1;
                queue.offer(poll.left);
            }
            if (poll.right != null) {
                poll.right.deep = poll.deep + 1;
                queue.offer(poll.right);
            }
        }
        return 0;
    }

这其中用到了Queue队列

queue.offer():添加元素;

queue.poll():返回第一个元素,并删除;

queue.element():返回第一个元素;

queue.peek():返回第一个元素.