在每个树行中找最大值

/**
 * 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!=NULL) que.push(root);
        while(!que.empty())
        {
            int size=que.size();
            int max=INT_MIN;
            vector<int> rec;
            for(int i=0;i<size;i++)
            {
                TreeNode *node=que.front();
                que.pop();
                rec.push_back(node->val);
                // if(node->val>max)
                // {
                //     max=node->val;
                // }
                if(node->left) que.push(node->left);
                if(node->right) que.push(node->right);
               
            }
             sort(rec.begin(),rec.end());
             reverse(rec.begin(),rec.end()); 
            //if(rec[0]>rec[1]) max=rec[0]; //第一层只有一个根节点，所以rec[1]要报错
          //  else
           // max=rec[1];
            result.push_back(rec[0]);
        }

        return result;
    }                   

};