给定一棵二叉树的根节点 root ,请找出该二叉树中每一层的最大值。
示例1:
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
解释:
1
/ \
3 2
/ \ \
5 3 9
示例2:
输入: root = [1,2,3]
输出: [1,3]
解释:
1
/ \
2 3
示例3:
输入: root = [1]
输出: [1]
示例4:
输入: root = [1,null,2]
输出: [1,2]
解释:
1
\
2
示例5:
输入: root = []
输出: []
提示:
二叉树的节点个数的范围是 [0,104]
-231 <= Node.val <= 231 - 1
代码:
class Solution {
public:
vector<int> largestValues(TreeNode* root) {
vector<int> res;
if(root == nullptr)
return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty())
{
int size = q.size();
int maxn = INT_MIN;
for(int i=0;i<size;i++)
{
if(q.front()->left!=nullptr)
q.push(q.front()->left);
if(q.front()->right!=nullptr)
q.push(q.front()->right);
maxn = max(maxn,q.front()->val);
q.pop();
}
res.emplace_back(maxn);
}
return res;
}
};