一般的层序遍历只是一股脑把树的节点打印出来,并不能看出层次。这道题要求遍历输出时要划分树的每一层。
方法一:在一般层序遍历的基础上记录节点的层数即可。C++中用pair同时存储树节点(TreeNode*)和层数(int)
#include<iostream>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
//definition of binary tree node
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<pair<TreeNode*,int>> q;
//queue<int> q2;
vector<vector<int>> ans;
if (root == nullptr) return ans;
vector<int> tempVec;
int curlayer = 0;
TreeNode* T;
q.push(make_pair(root, ++curlayer));
while (!q.empty())
{
T = q.front().first;
curlayer = q.front().second;
q.pop();
tempVec.push_back(T->val);
if (q.empty() || q.front().second != curlayer)//可以换行
{
vector<int> layerResult;
layerResult = tempVec;
ans.push_back(layerResult);
tempVec.clear();
}
if (T->left || T->right) curlayer++;//层序号增加
if (T->left)
{
q.push(make_pair(T->left, curlayer));
}
if (T->right)
{
q.push(make_pair(T->right, curlayer));
}
}
return ans;
}
};
方法二:可以发现,在一般的层序遍历的while判断队列是否为空时,有队列中的所有元素就是本层层的所有元素,并且按照从左向右的顺序排列,因此用一个for循环依次让这些节点值进入vector即可。
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> q;
vector<vector<int>> ans;
if (root == nullptr) return ans;
TreeNode* T;
q.push(root);
while (!q.empty())
{
int queueSize = q.size();
ans.push_back(vector<int>());//放入新的vector占位
for (int i = 0; i < queueSize; ++i)
{
T = q.front();
q.pop();
ans.back().push_back(T->val);
if (T->left)
{
q.push(T->left);
}
if (T->right)
{
q.push(T->right);
}
}
}
return ans;
}
};