513. 找树左下角的值 - 力扣(LeetCode) (leetcode-cn.com)
找树左下角的值
非递归
- 非递归方式显然容易,不考虑递归方式
- 层序遍历即可
class Solution {
public:
int findBottomLeftValue(TreeNode* root) {
int ans = root->val;
queue<TreeNode*> que;
que.push(root);
while (!que.empty()) {
int size = que.size();
for (int i = 0; i < size; ++i) {
TreeNode* node = que.front();
que.pop();
// 保存每层最左值
if (!i) ans = node->val;
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return ans;
}
};