LC.102. Binary Tree Level Order Traversal

二叉树层次遍历

最新推荐文章于 2023-05-30 21:42:39 发布

转载最新推荐文章于 2023-05-30 21:42:39 发布 · 109 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/davidnyc/p/8668122.html

本文介绍了一种解决LeetCode上二叉树层次遍历问题的方法。通过使用队列实现广度优先搜索策略，该算法能按层级顺序返回二叉树节点的值。文章提供了完整的Java代码实现，并考虑了特殊情况，例如当输入的二叉树为空时如何处理。

https://leetcode.com/problems/binary-tree-level-order-traversal/description/

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7

return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
Corner Cases

What if the binary tree is null? Return an empty list of list in this case:
return new ArrayList<List<Integer>>();

 1 class Solution {
 2     public List<List<Integer>> levelOrder(TreeNode root) {
 3         if (root == null) {
 4             return new ArrayList<List<Integer>>();
 5         }
 6         List<List<Integer>> res = new ArrayList<List<Integer>>();
 7         Queue<TreeNode> queue = new LinkedList<TreeNode>() ;
 8         queue.offer(root);
 9         while(!queue.isEmpty()){
10             int size = queue.size() ;
11             List<Integer> subRes = new ArrayList<>();
12             for (int i =0 ; i< size ; i++ ) {
13                 TreeNode node = queue.poll();
14                 subRes.add(node.val);
15                 if (node.left != null) {
16                     queue.offer(node.left);
17                 }
18                 if (node.right != null) {
19                     queue.offer(node.right);
20                 }
21             }
22             res.add(subRes);
23         }
24         return res ;
25     }
26 }

转载于:https://www.cnblogs.com/davidnyc/p/8668122.html