LeetCode Top 100 Liked Questions 102. Binary Tree Level Order Traversal (Java版; Medium)
题目描述
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]
]
classSolution{public List<List<Integer>>levelOrder(TreeNode root){
List<List<Integer>> list =newArrayList<>();if(root==null){return list;}
LinkedList<TreeNode> queue =newLinkedList<>();
queue.add(root);while(!queue.isEmpty()){int n = queue.size();
List<Integer> al =newArrayList<>();for(int i=0; i<n; i++){
TreeNode cur = queue.poll();
al.add(cur.val);if(cur.left!=null){
queue.add(cur.left);}if(cur.right!=null){
queue.add(cur.right);}}
list.add(al);}return list;}}
LeetCode Top 100 Liked Questions 102. Binary Tree Level Order Traversal (Java版; Medium)
welcome to my blogLeetCode Top 100 Liked Questions 102. Binary Tree Level Order Traversal (Java版; Medium)题目描述Given a binary tree, return the level order traversal of its nodes' values. (ie, from le...