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.

tips：这题我只是知道如何遍历所有节点，但是对于树深度的把握不是很好，上网搜索找到了一个十分巧妙地方法。记录一下，下次面对类似题目不会束手无措

源码如下：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
   private int result = 0, height = 0;
   public int findBottomLeftValue(TreeNode root) {
         helper(root, 1);
         return result;
     }
     
     private void helper(TreeNode root, int depth) {
         if (root == null) return;
         
         if (height < depth) {
             result = root.val;  //这里很巧妙，只有第一次递归到才会由于深度变化而改变，换句话说，保证是左子树来修改
             height = depth;
         }
         
         helper(root.left, depth + 1);
         helper(root.right, depth + 1);
         }
}