leetCode513

/**
 * 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 {
private:
    int num;
public:
    int findBottomLeftValue(TreeNode* root) {
        queue<TreeNode* >q;
        q.push(root);
        
        while(!q.empty())
        {
            queue<TreeNode*>q1;
            num = q.front()->val;
            while(!q.empty())
            {
                TreeNode* tmp = q.front();
                q.pop();
                if(tmp->left)
                q1.push(tmp->left);
                if(tmp->right)
                q1.push(tmp->right);
            }
            while(!q1.empty())
            {
                TreeNode* tmp = q1.front();
                q1.pop();
                q.push(tmp);
            }
            
        }
        return num;
    }
};