题目链接:力扣
/**
* 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;
vector<int>result;
if(root!=nullptr) que.push(root);
while(!que.empty())
{
int size=que.size();
int maxvalue=INT_MIN;
for(int i=0;i<size;i++)
{
TreeNode* node=que.front();
que.pop();
maxvalue=node->val>maxvalue?node->val:maxvalue;
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
result.push_back(maxvalue);
}
return result;
}
};