45 二叉树的锯齿形层次遍历
1.问题描述
给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回锯齿形层次遍历如下:
[
[3],
[20,9],
[15,7]
]
程序输出:
3 20 9 15 7
可使用以下main函数:
#include
#include
#include
#include
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(NULL), right(NULL) {}
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
TreeNode* inputTree()
{
int n,count=0;
char item[100];
cin>>n;
if (n==0)
return NULL;
cin>>item;
TreeNode* root = new TreeNode(atoi(item));
count++;
queue<TreeNode*> nodeQueue;
nodeQueue.push(root);
while (count<n)
{
TreeNode* node = nodeQueue.front();
nodeQueue.pop();
cin>>item;
count++;
if (strcmp(item,"null")!=0)
{
int leftNumber = atoi(item);
node->left = new TreeNode(leftNumber);
nodeQueue.push(node->left);
}
if (count==n)
break;
cin>>item;
count++;
if (strcmp(item,"null")!=0)
{
int rightNumber = atoi(item);
node->right = new TreeNode(rightNumber);
nodeQueue.push(node->right);
}
}
return root;
}
int main()
{
TreeNode* root;
root=inputTree();
vector<vector<int> > res=Solution().zigzagLevelOrder(root);
for(int i=0; i<res.size(); i++)
{
vector<int> v=res[i];
for(int j=0; j<v.size(); j++)
cout<<v[j]<<" ";
}
}
2.输入说明
首先输入结点的数目n(注意,这里的结点包括题中的null空结点)
然后输入n个结点的数据,需要填充为空的结点,输入null。
3.输出说明
输出结果,每个数据的后面跟一个空格。
4.范例
输入
7
3 9 20 null null 15 7
输出
3 20 9 15 7
5.代码
#include <iostream>
#include <queue>
#include <cstdlib>
#include <cstring>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(NULL), right(NULL) {}
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
TreeNode* inputTree()
{
int n, count = 0;
char item[100];
cin >> n;
if (n == 0)
return NULL;
cin >> item;
TreeNode* root = new TreeNode(atoi(item));
count++;
queue<TreeNode*> nodeQueue;
nodeQueue.push(root);
while (count < n)
{
TreeNode* node = nodeQueue.front();
nodeQueue.pop();
cin >> item;
count++;
if (strcmp(item, "null") != 0)
{
int leftNumber = atoi(item);
node->left = new TreeNode(leftNumber);
nodeQueue.push(node->left);
}
if (count == n)
break;
cin >> item;
count++;
if (strcmp(item, "null") != 0)
{
int rightNumber = atoi(item);
node->right = new TreeNode(rightNumber);
nodeQueue.push(node->right);
}
}
return root;
}
vector<vector<int> > zigzagLevelOrder(TreeNode *root) {
//思想:要求从左到右,下一层从右往左遍历
//用双端队列,若从左往右,则队尾插入结点,若从右往左,从在队头插入结点 用flag记录遍历方向 ,flag=1从左往后 ,flag=0从右往左
vector<vector<int> >res;
if (!root)
return res; //空树
queue<TreeNode*>q_node;//记录每个结点
q_node.push(root);//根节点入队列
int flag = 1;//记录遍历方向,若从左往右,则为1
while (!q_node.empty())
{
//使用双端队列记录每层结点
deque<int> LevelList;
int size = q_node.size();
for (int i = 0; i < size; i++)
{
auto node = q_node.front();//访问每一个结点
q_node.pop();//结点出队
if (flag == 1)//正向【从左向右】遍历,在队尾插入元素
{
LevelList.push_back(node->val);//队尾插入
}
else
{
LevelList.push_front(node->val);//队头插入
}
//该结点左子树存在,左子树入队列
if (node->left)
q_node.push(node->left);//结点入队
if (node->right)
q_node.push(node->right);
}
flag=!flag;//这里必须这么写,不能写flag=0;[否则后面一直都是0]
res.push_back(vector<int>{LevelList.begin(), LevelList.end()});
}
return res;
}
int main()
{
TreeNode* root;
root = inputTree();
vector<vector<int> > res = zigzagLevelOrder(root);
for (int i = 0; i < res.size(); i++)
{
vector<int> v = res[i];
for (int j = 0; j < v.size(); j++)
cout << v[j] << " ";
}
}