class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Deque<TreeNode> st = new LinkedList<>();
List<List<Integer>> res = new LinkedList<>();
if(root == null) return res;
st.addLast(root);
while(st.size() > 0){
int size = st.size();
List<Integer> arr = new LinkedList<>();
while(size > 0){
TreeNode node = st.pollFirst();
arr.add(node.val);
if(node.left != null) st.addLast(node.left);
if(node.right != null) st.addLast(node.right);
size--;
}
res.add(arr);
}
return res;
}
}
用队列实现,不是栈,因为是顺序遍历