513. Find Bottom Left Tree Value

class Solution {
public:
    int findBottomLeftValue(TreeNode* root) {
        int res;
        queue<TreeNode*> q;
        TreeNode* left;
        if(root)
            q.push(root);
        while(!q.empty()){
            int size=q.size();
            left=q.front();
            for(int i=0;i<size;i++){
                TreeNode* cur=q.front();
                q.pop();
                if(cur->left)
                    q.push(cur->left);
                if(cur->right)
                    q.push(cur->right);
            }
        }
        res=left->val;
        return res;
    }
};