C++ | Leetcode C++题解之第513题找树左下角的值

题目：

题解：

class Solution {
public:int findBottomLeftValue(TreeNode* root) {int ret;queue<TreeNode *> q;q.push(root);while (!q.empty()) {auto p = q.front();q.pop();if (p->right) {q.push(p->right);}if (p->left) {q.push(p->left);}ret = p->val;}return ret;}
};