Given a binary tree, find the leftmost value in the last row of the tree.
Example
No.1
Input:
Output:
1
No.2
Input:
1
2
3
4
5
6
7
|
1
/
2 3
/ /
4 5 6
/
7
|
Output:
7
Note
You may assume the tree (i.e., the given root node) is not NULL.
Code
1
2
3
4
5
6
|
public class {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
public int findBottomLeftValue(TreeNode root) {
int result = 0;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
result = node.val;
if (node.right != null)
queue.offer(node.right);
if (node.left != null)
queue.offer(node.left);
}
}
return result;
}
|
近期评论