摘要：
public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> res = new ArrayList(); if(root == null) return res; Deque<TreeNode> q = new 阅读全文
摘要：
public List<Integer> largestValues(TreeNode root) { List<Integer> list = new ArrayList(); if(root == null) return list; Deque<TreeNode> q = new Linked 阅读全文