1.层次遍历
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> ans = new ArrayList<>();
if(root == null) return ans;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.addLast(root);
while(!queue.isEmpty()){
int size = queue.size();
List<Integer> list = new ArrayList<>();
while(size>0){
TreeNode temp = queue.removeFirst();
list.add(temp.val);
if(temp.left!=null)queue.addLast(temp.left);
if(temp.right!=null)queue.addLast(temp.right);
size--;
}
ans.add(list);
}
return ans;
}
}