注意:要按层次,分别放在一个表格里 再一起返回
Java:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Queue<TreeNode> que=new LinkedList<TreeNode>();
List<List<Integer>> lists=new ArrayList<>();
if(root==null) return lists;
que.offer(root);
int size;
while(!que.isEmpty()){
size=que.size();
List<Integer> list&