力扣513.找树左下角的值

用迭代层层遍历，记录做边节点的值，当遍历完最后一层，左边的值就是要找的数

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int findBottomLeftValue(TreeNode* root) {
        queue<TreeNode *>que;
        if(root != NULL) que.push(root);
        int rle = 0;
        while(!que.empty()){
            int cont = que.size();
            for(int i = 0;i < cont;i++){
                TreeNode *node = que.front();
                que.pop();
                if(i == 0) rle = node -> val;
                if(node->left) que.push(node->left);
                if(node->right) que.push(node->right);
            }
        } 
        return rle;
    }
};