03-树3 Tree Traversals Again (25 分)

 

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.

Figure 1

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

 思路：每次Push的内容按顺序输出就是先序遍历；然后根据Push和Pop输出的内容是中序遍历；

最后根据先序遍历和中序遍历转化为后序遍历：

参考：https://blog.csdn.net/feliciafay/article/details/6816871

#include<stdio.h>
#include<string.h>
#include<malloc.h>
typedef struct StackNode* Stack;
struct StackNode{
    int data[32];
    int top;
};
int flag = 0;
void Push(Stack S, int a){
    S->top++;
    S->data[S->top] = a;
}
int Pop(Stack S){
    S->top--;
    return S->data[S->top + 1];
}
void Getstring(int* pr, int* in, int n){
    int i;
    char temp[100];
    int temp_value;
    int pr_j, in_j;
    Stack S;
    S = (Stack)malloc(sizeof(struct StackNode));
    S->top = -1;
    pr_j = in_j = 0;
    for( i = 0; i < 2*n; i++){
        scanf("%s",temp);
        if (!strcmp(temp,"Push")){
            scanf("%d",&temp_value);
            Push(S,temp_value);
            pr[pr_j++] = temp_value;
        }
        else{
            temp_value = Pop(S);
            in[in_j++] = temp_value;
        }
    }
}
void PostOrder(int* pr, int* in, int length){
    int temp_value;
    int i;
    if ( length == 0) return;
    temp_value = pr[0];
    for(i = 0 ; i < length; i++)
        if (in[i] == temp_value)
            break;
    PostOrder(pr+1, in, i);
    PostOrder(pr+i+1,in+i+1,length-i-1);
    if(flag)
        printf(" ");
    printf("%d",temp_value);
    flag = 1;
}
int main(){
    int n;
    int i;
    int pr[32] = {0}, in[32] = {0};
    scanf("%d",&n);
    Getstring(pr,in,n);
    PostOrder(pr,in,n);
}