LeetCode 513. 【层序遍历】树最左小角的值
原题链接
中等
作者:
大明湖的鱼
,
2021-01-16 14:59:55
,
所有人可见
,
阅读 322
/**
* 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*> q;
q.push(root);
TreeNode* p;
while(!q.empty()){
p = q.front();
q.pop();
if(p->right) q.push(p->right);
if(p->left) q.push(p->left); //这两句不能颠倒,即最左节点
}
return p->val;
}
};