层次遍历,太简单了,一次过。
vector<int> largestValues(TreeNode* root) {
queue<TreeNode *> que;
vector<int> vec;
if (!root) return vec;
que.push(root);
while(!que.empty()) {
int size = que.size();
int max = INT_MIN;
while (size--) {
TreeNode *node = que.front();
que.pop();
if(node->val > max) max = node->val;
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
vec.push_back(max);
}
return vec;
}