给定一棵二叉树的根节点 root ,请找出该二叉树中每一层的最大值。
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
解释:
1
/
3 2
/ \ \
5 3 9
解:
注意: int的最小值为INT_MIN
最大值为INT_MAX
class Solution {
public:
vector<int> largestValues(TreeNode* root) {
vector<int> result;
if(!root) return result;
queue<TreeNode *> treeQueue;
treeQueue.push(root);
while (!treeQueue.empty()) {
int maxValue = INT_MIN;
int nSize = treeQueue.size();
for (int i = 0; i < nSize; i++) {
TreeNode * tempNode = treeQueue.front();
treeQueue.pop();
if (tempNode -> left) treeQueue.push(tempNode -> left);
if (tempNode -> right) treeQueue.push(tempNode -> right);
maxValue = max(maxValue,tempNode -> val);
}
result.push_back(maxValue);
}
return result;
}
};```