题目
- Total Accepted: 8467
- Total Submissions: 15077
- Difficulty: Medium
- Contributors: abhijeet17
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 NUL
https://leetcode.com/problems/find-bottom-left-tree-value/#/description思路
题目需要找到树的最后一层中最左边的点。
思路是从根出发并遍历节点的时候,记录下走到该点时的深度,以及目前的最大深度。而同一深度的所有点中,最左边的一定是最先被访问到的,所以一发现现有的深度大于最大深度,该点即是该深度的层中最左边的点,记录下该点。最后输出最大深度下记录的点,即为最深一层最左边的点。
源程序
/**
* 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) {
int x[10000],i,maxdep = 0,dep = 0;
if(root){
dfs(root,dep,maxdep,x);
}
return x[maxdep];
}
void dfs(TreeNode *root,int dep,int &maxdep,int x[]){
if(dep > maxdep){
x[dep] = root->val;
maxdep = dep;
}
if(root->left != NULL)
dfs(root->left,dep + 1,maxdep,x);
if(root->right != NULL)
dfs(root->right,dep + 1,maxdep,x);
}
};