public class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> result = new ArrayList<>();
this.largestValues(root, 0, result);
return result;
}
private void largestValues(TreeNode node, int depth, List<Integer> result) {
if (node == null) {
return;
}
if (result.size() <= depth) {
result.add(node.val);
}
else if (result.get(depth) < node.val) {
result.set(depth, node.val);
}
this.largestValues(node.left, depth + 1, result);
this.largestValues(node.right, depth + 1, result);
}
}
近期评论