二叉树广度优先遍历

万事尽全力

于 2024-07-01 17:12:54 发布

阅读量141

点赞数 1

文章标签：宽度优先算法 java

本文链接：https://blog.csdn.net/m0_58257626/article/details/140101553

版权

二叉树的广度优先遍历也叫层序遍历

102. 二叉树的层序遍历

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        if(root == null){
            return res;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            List<Integer> level=new ArrayList<>();
            int levelSize = queue.size();
            for(int i = 0;i<levelSize; i++){
                root = queue.poll();
                level.add(root.val);
                if(root.left != null){
                    queue.offer(root.left);
                }
                if(root.right != null){
                    queue.offer(root.right);
                }
            }
            res.add(level);
        }
        return res;
    }
}

103. 二叉树的锯齿形层序遍历

/**
 * 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 static int MAXN = 2001;
    public static TreeNode[] queue  = new TreeNode[MAXN];
    public static int l,r;
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> ans = new ArrayList<>();
        if(root != null){
            l=r=0;
            queue[r++]=root;
            boolean reverse = false;
            while(l<r){
                int size = r-l;
                List<Integer> level = new ArrayList<>();
                for(int i = reverse ? r-1 : l, j = reverse ? -1 : 1, k=0; k < size; i+=j,k++){
                    TreeNode cur = queue[i];
                    level.add(cur.val);
                }
                for(int i=0; i<size; i++){
                    TreeNode tmp = queue[l++];
                    if(tmp.left != null){
                        queue[r++] = tmp.left;
                    }
                    if(tmp.right != null){
                        queue[r++] = tmp.right;
                    }
                }
                ans.add(level);
                reverse = !reverse;
            }
        }
        return ans;
    }
}