二叉树的广度优先遍历

我们用到一个队列来完成树的广度优先遍历

1.首先第一层结点入队,

2.当队列不为空第一层结点从左到右依次出队且遍历他们各自的孩子

3.如果孩子不为空则入队尾,

重复2和3直到最后一层的最后一个孩子出队遍历结束;

下面代码实现一下:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
            TreeNode cur = root;
            Deque<TreeNode> queue=new LinkedList<>();
            List<Integer> list=new ArrayList<>();
            queue.offer(cur);
            while(cur != null){
                TreeNode poll = queue.poll();
                list.add(poll.val);
                if(poll.left != null) queue.offer(poll.left);
                if(poll.right != null) queue.offer(poll.right);
            }
            return list;
}
}

下面我们来做一道leetcode题目巩固一下:

题目要求我们每层存在一个链表里,所以加一个for循环即可,当每层循环结束再把那一层数据收集起来

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {

        List<List<Integer>> re=new ArrayList<>();
        if(root==null) return re;
        Queue<TreeNode> queue=new LinkedList<>();
        queue.offer(root);
      
        while (!queue.isEmpty()){
            List<Integer> row=new ArrayList<>();
            //这里注意不要直接把queue.size()当做for循环的判定条件,
            //因为这个值随着结点的出队入队是会改变的
            int curSize=queue.size();
            for (int i = 0; i < curSize; i++) {
                TreeNode treeNode = queue.poll();
                row.add(treeNode.val);
                if(treeNode.left!=null){
                    queue.offer(treeNode.left);              
                }
                 if(treeNode.right!=null) {
                    queue.offer(treeNode.right);
                }
            }
            re.add(row);
        }
        return re;
    }
}

类似的题目还有:

103. 二叉树的锯齿形层序遍历:https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/

可自己去练习巩固哦!!!