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.
 * 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<TreeNode>();
        queue.offer(root);
        int leftmost = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            leftmost = queue.peek().val;
            for (int i = 0; i < size; i ++) {
                TreeNode currNode = queue.poll();
                if (currNode.left != null) queue.offer(currNode.left);
                if (currNode.right != null) queue.offer(currNode.right);
            }
        }
        return leftmost;
    }
}

可以改变一下添加node的顺序，先right，后left，最后剩下的节点就是最后一行最左的节点。代码如下：

public class Solution {
    public int findBottomLeftValue(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            root = queue.poll();
            if (root.right != null)
               queue.add(root.right);
            if (root.left != null)
                queue.add(root.left);
        }
        return root.val;
    }
}