leetcode 513. Find Bottom Left Tree Value

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.

1、题目是找最下面一排的最左边的那个节点。

2、那就是经典的BFS。

3、那就queue一行一行来找。

/**
 * 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)
    {
        queue<TreeNode*> que;
        que.push(root);
        TreeNode* ret = NULL;
        while (!que.empty())
        {
            int size = que.size();
            ret = que.front();
            for (int i = 0; i < size; i++)
            {
                TreeNode* tmp = que.front();
                que.pop();
                if (tmp->left)
                    que.push(tmp->left);
                if (tmp->right)
                    que.push(tmp->right);
            }
        }
        return ret->val;
    }
};