/**
* 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) {
if (!root) return 0;
queue<TreeNode*> que;
que.push(root);
int result;
while (!que.empty()) {
int size = que.size();
TreeNode* node;
for (int i = 0; i < size; i++) {
node = que.front();
que.pop();
if (i == 0) result = node->val;
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
}
return result;
}
};
513. 找树左下角的值(层序遍历)
最新推荐文章于 2023-02-03 10:41:11 发布