来自柳婼
输出层序的话可以用数组每层遍历存储,参考PAT甲级1020
(普通二叉树)已知后序中序输出前序
#include <iostream>
using namespace std;
int post[] = {3, 4, 2, 6, 5, 1};
int in[] = {3, 2, 4, 1, 6, 5};
void pre(int root, int start, int end) {
if(start > end) return ;
int i = start;
while(i < end && in[i] != post[root]) i++;
printf("%d ", post[root]);
pre(root - 1 - end + i, start, i - 1);
pre(root - 1, i + 1, end);
}
int main() {
pre(5, 0, 5);
return 0;
}
(普通二叉树)已知中序前序输出后序:
#include <iostream>
using namespace std;
int pre[] = {4,1,3,2,6,5,7};
int in[] = {1,2,3,4,5,6,7};
void post(int root, int start, int end) {
if(start > end) return ;
int i = start;
while(i < end && in[i] != pre[root]) i++;
post(root + 1, start, i - 1);
post(root+i-start+1, i + 1, end);
printf("%d ", pre[root]);
}
int main() {
post(0,0,6);
return 0;
}
(二叉搜索树)已知前序,输出后序:
void pretopost(int root, int tail) {
if(root > tail) return ;
int i = root + 1, j = tail;
while(i <= tail && pre[root] > pre[i]) i++;
while(j > root && pre[root] <= pre[j]) j--;
if(i - j != 1) return ;
getpost(root + 1, j);
getpost(i, tail);
post.push_back(pre[root]);//printf()
}