Problem
Given a binary tree, find the leftmost value in the last row of the tree.
Example 1:
Input:
2
/ \
1 3
Output:
1
Example 2:
Input:
1
/ \
2 3
/ / \
4 5 6
/
7
Output:
7
Note: You may assume the tree (i.e., the given root node) is not NULL.
Solution
题意
输入一个二叉树,要求输出最底层最左边的节点的值。
分析
这道题很容易想到利用BFS的性质——进行层序遍历,且每层访问的第一个节点就是最左边的节点,故使用BFS算法即可解决这个问题。
Code
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int findBottomLeftValue(TreeNode* root) {
/* 利用BFS的性质,进行层序遍历,遍历最后一层的第一个节点的值即为题目要求的结果 */
int result = root->val;
queue<TreeNode *> q;
q.push(root);
while(!q.empty()){
int size = q.size();
for (int i = 0; i < size; i++){
TreeNode * now = q.front();
q.pop();
if (i == 0)
result = now->val; //每一层最左的节点的值
if (now->left != NULL)
q.push(now->left);
if (now->right != NULL)
q.push(now->right);
}
}
return result;
}
};
//Runtime:12ms