思路:
简单的二叉树层次遍历的推广。二叉树层次遍历是典型的广度优先搜索(BFS)的应用。代码如下:
/**
* 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> res;
if(!root) return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
int m=INT_MIN, size=q.size();
for(int i=0;i<size;++i){
TreeNode* node=q.front();q.pop();
m=max(m,node->val);
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
res.push_back(m);
}
return res;
}
};