/**
* 102. Binary Tree Level Order Traversal
*
* Problem 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,#,#,15,7]
* 3
* / \
* 9 20
* / \
* 15 7
* return [[3],[9,20],[15,7]]
*
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<TreeNode>();
List<List<Integer>> wrapList = new LinkedList<List<Integer>>();
if(root == null) return wrapList;
queue.offer(root);
while(!queue.isEmpty()){
int levelNum = queue.size();
List<Integer> subList = new LinkedList<Integer>();
for(int i=0; i<levelNum; i++) {
if(queue.peek().left != null) queue.offer(queue.peek().left);
if(queue.peek().right != null) queue.offer(queue.peek().right);
subList.add(queue.poll().val);
}
wrapList.add(subList);
}
return wrapList;
}
}
102. Binary Tree Level Order Traversal
最新推荐文章于 2022-02-20 23:20:19 发布