class Solution {
public:
vector<int> largestValues(TreeNode* root) {
vector<int> res;
if(root==NULL)
return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
int size=q.size();
int min=INT_MIN;
for(int i=0;i<size;i++){
TreeNode* node=q.front();
q.pop();
if(node->val>min){
min=node->val;
}
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);
}
res.push_back(min);
}
return res;
}
};
515. Find Largest Value in Each Tree Row
最新推荐文章于 2018-06-12 17:38:34 发布