[力扣题解] 513. 找树左下角的值

题目：513. 找树左下角的值

思路

层序遍历

代码

// 层序遍历
class Solution {
public:
    int findBottomLeftValue(TreeNode* root) {
        queue<TreeNode*> que;
        vector<vector<int>> result;
        
        int i, size;

        que.push(root);
        while(!que.empty())
        {
            vector<int> line; // 每一层
            size = que.size();
            for(i = 0; i < size; i++)
            {
                TreeNode* cur = que.front();
                line.push_back(cur->val);
                que.pop();
                if(cur->left)
                {
                    que.push(cur->left);
                }
                if(cur->right)
                {
                    que.push(cur->right);
                }
            }
            result.push_back(line);
        }

        return result[result.size()-1][0];
    }
};