class Solution {
public int findBottomLeftValue(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
int result = root.val;
while (!queue.isEmpty()) {
Queue<TreeNode> queue2 = new LinkedList<>();
TreeNode node = queue.peek();
result = node.val;
while (!queue.isEmpty()) {
node = queue.poll();
if (node.left != null) {
queue2.add(node.left);
}
if (node.right != null) {
queue2.add(node.right);
}
}
queue = queue2;
}
return result;
}
}
近期评论