给定一棵二叉树的根节点 root ,请找出该二叉树中每一层的最大值。
示例1:
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/find-largest-value-in-each-tree-row
思路:
层序遍历,取每一层最大值
代码如下:
/**
* 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:
vector<int> largestValues(TreeNode* root) {
queue<TreeNode*> que;
if(root != NULL)
{
que.push(root);
}
vector<int> result;
while(!que.empty())
{
int size = que.size();
int max = INT_MIN;
for(int i = 0; i < size; i++)
{
TreeNode* node = que.front();
que.pop();
max = node->val > max ? node->val : max;
if(node->left)
{
que.push(node->left);
}
if(node->right)
{
que.push(node->right);
}
}
result.push_back(max);
}
return result;
}
};