LeetCode102:二叉树的层序遍历

最新推荐文章于 2024-10-20 14:42:24 发布

凌晨两点半还不回家

最新推荐文章于 2024-10-20 14:42:24 发布

阅读量71

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_35654080/article/details/107087248

版权

LeetCode 专栏收录该内容

103 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> ans = new ArrayList<>();
        while(root==null){
            return ans;
        }
        //建立队列
        Queue<TreeNode> q = new LinkedList<>();
        //根节点入队列
        q.add(root);
        while(!q.isEmpty()){
            List<Integer> tem = new LinkedList<>();
            int size = q.size();
            for(int i = 0;i < size;i++){
                TreeNode cur = q.poll();
                

                if(cur == null) continue;
                tem.add(cur.val);
                q.add(cur.left);
                q.add(cur.right);

                
            }
            if(!tem.isEmpty()){
                ans.add(tem);
            }

        }
        return ans;

    }
}