513. Find Bottom Left Tree Value

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.

解法：

/**
 * 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 maxlevel = 0;
        int leftval = root->val;
        find(root,maxlevel,leftval,0);
        return leftval;
    }

    void find(TreeNode*root,int &maxlevel,int &leftval,int depth)
    {
        if(!root) return;
         if(depth > maxlevel)//每次寻找当前最深的节点
        {
            maxlevel = depth;
            leftval = root->val;
       }
        find(root->left,maxlevel,leftval,depth+1);
        find(root->right,maxlevel,leftval,depth+1);


    }
};