【LectCode】515. Find Largest Value in Each Tree Row

题目：

515. Find Largest Value in Each T

Description Hints Submissions Discuss Solution

Discuss  Editorial Solution Pick One

---

You need to find the largest value in each row of a binary tree.

Example:

Input: 

          1
         / \
        3   2
       / \   \  
      5   3   9 

Output: [1, 3, 9]

解题思路：用一个队列来存储树的节点，用一个整数count来计数当前层的节点的个数，将num赋值为INT_MAX，依次访问队列中当前层的节点，将其与num比较，若比num大则将num赋值为当前节点的值，并将该节点的左右子节点加入队列中，删除节点。

解答：

*
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> largestValues(TreeNode* root) {
        vector<int> vec;
if(root == NULL){
return vec;
} 
else{
queue<TreeNode*> q;
q.push(root);
int count,num;
TreeNode* node; 
while(!q.empty()){
num = INT_MIN;
count = q.size();
while(count){
node = q.front();
if(num < node->val){
num = node->val;
}
if(node->left != NULL){
q.push(node->left );
}
if(node->right != NULL){
q.push(node->right );
}
q.pop();
count --;
}
vec.push_back(num);
}
}
return vec;
    }
    
};