题1:
指路:LeetCode102 二叉树的层序遍历
思路与代码:
对于二叉树的层序遍历很显然它自己没有这个能力,需要借助队列完成这个工作。我们将树中的元素一层层地放入队列中然后弹出到数组中,最后以二维数组的形式输出。这就需要我们控制弹出的元素数量 ,即控制弹出数量为每层的元素数量。代码如下:
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> que;
if (root != NULL) que.push(root); // 当根节点不为空时入队列
vector<vector<int>> result; // 最后二维数组的结果集
while ( !que.empty() ) {
int size = que.size(); // 记录每层的元素数量
vector<int> vec; // 每层的元素结果集
for (int i = 0; i < size; i++) { // 在控制数量的条件下
TreeNode* node = que.front(); // 队列的首元素
que.pop();
vec.push_back(node->val); // 每层元素入栈
if (node->left) que.push(node->left); // 左右孩子入队列
if (node->right) que.push(node->right);
}
result.push_back(vec); // 每层的一维数组入队列
}
return result; // 返回二维数组
}
};
相似题:
指路:LeetCode107 二叉树的层序遍历Ⅱ
代码:结合题目描述,在题1的基础上反转数组即可。
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
queue<TreeNode*> que;
vector<vector<int>> result;
if (root != NULL) que.push(root);
while (!que.empty()) {
int size = que.size();
vector<int> vec;
while (size--) {
TreeNode* node = que.front();
que.pop();
vec.push_back(node->val);
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
result.push_back(vec);
}
reverse(result.begin(), result.end());
return result;
}
};
题2:
指路:LeetCode199 二叉树的右视图
思路与代码:
我们只需将每层的尾元素放入vector中返回即可。代码如下:
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
queue<TreeNode*> que;
vector<int> result;
if (root != NULL) que.push(root);
while (!que.empty()) {
int size = que.size();
for (int i = 0; i < size; i++) {
TreeNode* node = que.front();
que.pop();
if (i == size - 1) result.push_back(node->val);
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return result;
}
};
题3:
指路:LeetCode637 二叉树的层平均值
思路与代码:
class Solution {
public:
vector<double> averageOfLevels(TreeNode* root) {
queue<TreeNode*> que;
if (root != NULL) que.push(root);
vector<double> result;
while ( !que.empty() ) {
int size = que.size();
double sum = 0;
for (int i = 0; i < size; i++) {
TreeNode* node = que.front();
que.pop();
sum += node->val;
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
result.push_back(sum / size);
}
return result;
}
};
题4:
指路:LeetCode429 N叉树的层序遍历
代码:
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<vector<int>> levelOrder(Node* root) {
queue<Node*> que;
if (root != NULL) que.push(root);
vector<vector<int>> result;
while ( !que.empty() ) {
int size = que.size();
vector<int> vec;
while (size--) {
Node* node = que.front();
que.pop();
vec.push_back(node->val);
for (int i = 0; i < node->children.size(); i++) {
if (node->children[i]) que.push(node->children[i]);
}
}
result.push_back(vec);
}
return result;
}
};
题5:
指路:LeetCode515 在每个树行中找最大值
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> largestValues(TreeNode* root) {
queue<TreeNode*> que;
vector<int>result;
if (root != NULL) que.push(root);
while (!que.empty()) {
int size = que.size();
int maxValue = INT_MIN;
for (int i = 0; i < size; i++) {
TreeNode* node = que.front();
que.pop();
maxValue = node->val > maxValue ? node->val : maxValue;
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
result.push_back(maxValue);
}
return result;
}
};