lintcode/leetcode由易至难第18题：Find Bottom Left Tree Value

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.

Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int findBottomLeftValue(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();  //一看就用到广度优先搜索，用linkedlist实现一个queue
        queue.add(root);  //先把root压入
        while(!queue.isEmpty()){
            root = queue.poll(); //root弹出，右子树压入，左子树压入，画个图就理解了
            if (root.right != null){
                queue.add(root.right);  
            }
            if (root.left != null){
                queue.add(root.left);
            }
        }
        return root.val;
    }
}