解题思路使用队列class Solution { public ListListInteger levelOrder(TreeNode root) { if (root null) return new ArrayList(); DequeTreeNode queue new ArrayDeque(); ListListInteger res new ArrayList(); queue.add(root); while (!queue.isEmpty()) { int size queue.size(); ListInteger path new ArrayList(); for (int i 0; i size; i) { TreeNode tmp queue.poll(); if (tmp.left ! null) queue.add(tmp.left); if (tmp.right ! null) queue.add(tmp.right); path.add(tmp.val); } res.add(path); } return res; } } 力扣 LeetCode 102. 二叉树的层序遍历（Day6：二叉树）
解题思路使用队列class Solution { public ListListInteger levelOrder(TreeNode root) { if (root null) return new ArrayList(); DequeTreeNode queue new ArrayDeque(); ListListInteger res new ArrayList(); queue.add(root); while (!queue.isEmpty()) { int size queue.size(); ListInteger path new ArrayList(); for (int i 0; i size; i) { TreeNode tmp queue.poll(); if (tmp.left ! null) queue.add(tmp.left); if (tmp.right ! null) queue.add(tmp.right); path.add(tmp.val); } res.add(path); } return res; } } RELATED READING
延伸阅读
更多一线实战笔记与深度复盘，助您持续精进
