Tree Traversals Again
题目阐述
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.
![]()
Input Specification:Each input file contains one test case. For each case, the first line contains a positive integer N (<=30) which is the total number of nodes in a tree (and hence the nodes are numbered from 1 to N). Then 2N lines follow, each describes a stack operation in the format: “Push X” where X is the index of the node being pushed onto the stack; or “Pop” meaning to pop one node from the stack.
Output Specification:
For each test case, print the postorder traversal sequence of the corresponding tree in one line. A solution is guaranteed to exist. All the numbers must be separated by exactly one space, and there must be no extra space at the end of the line.
Sample Input:
6
Push 1
Push 2
Push 3
Pop
Pop
Push 4
Pop
Pop
Push 5
Push 6
Pop
Pop
Sample Output:
3 4 2 6 5 1
题目分析
- 分别将push数字的顺序和pop数字的顺序拿出来看就会发现,分别是下前序遍历和中序遍历,然后依照此将后序遍历求出即可;
- 此处采用了两种方法,第一种是老老实实的构建二叉树,第二种是参考的柳神的博客,直接在构建的过程中就得出了后序遍历的数值,即为下图中的 help()函数;
代码实现
#include <stdio.h>
#include <iostream>
#include <string>
#include <stack>
#include <vector>
using namespace std;
int pre[31], in[31];
vector<int> post;
stack<int> st;
struct node {
int val;
struct node* left, *right;
};
void help(int pl, int il, int ir) {
if (il > ir) return;
int index = il;
while (index < ir && in[index] != pre[pl]) index ++;
int len = index - il;
help (pl+1, il, index-1);
help (pl+len+1, index+1, ir);
post.push_back(in[index]);
}
node* construct (int pl, int il, int ir) {
if (il > ir) return NULL;
node* temp = (node*)malloc(sizeof(node));
int index = il;
while (index < ir && in[index] != pre[pl]) index ++;
int len = index - il;
temp->val = in[index];
temp->left = construct(pl+1, il, index-1);
temp->right = construct(pl+len+1, index+1, ir);
return temp;
}
void postorder(node* head) {
if (NULL == head) return;
postorder(head->left);
postorder(head->right);
post.push_back(head->val);
}
int main() {
int n, icnt = 0, pcnt = 0;
int a[6] = {1, 2, 3, 4, 5, 6};
int b[6] = {3, 2, 4, 1, 6, 5};
n = 6;
for (int i=0; i<n; i++) {
pre[i] = a[i];
in[i] = b[i];
}
node* head = construct(0, 0, n-1);
postorder(head);
//help(0, 0, n-1); 第二种方法;
for (int i=0; i<post.size(); i++)
if (i == 0) printf("%d", post[i]);
else printf(" %d", post[i]);
return 0;
}
题后总结
- 这一道题,加深了对结构体,指针等的运用,尤其是malloc,在创建节点的时候,是不可缺少的;以及struct关键字,其实很多场合下可有可无;