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.

Figure 1

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer $N$ ($\le 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

result:

 
 

  
  #include<stdio.h>
#include<stdlib.h>
 
 
 
 

  
  typedef struct TreeNode *Tree;
struct TreeNode {
    int Element;
 int pop;
    Tree  Left;
    Tree  Right;
 Tree  Fa;
};
push(Tree s, int Ele);
pop(Tree s);
postorder(Tree s,int nodenum);
visit(Tree s,int nudenum);
static a=0;
static k=0;
int main(void)
{
 int nodenum;
 int Ele;
 char c[4];
 Tree s;
 Tree head;
 int repeat=0;
 s=(Tree)malloc(sizeof(struct TreeNode));
 head=s;
 s->Left=NULL;
 s->Right=NULL;
 scanf("%d",&nodenum);
 if(nodenum==0)
  return 0;
 while(repeat<2*nodenum)
 {
  scanf("%s",c);
  switch(c[1])
  {
   case 'u': scanf("%d",&Ele);s=push(s,Ele);repeat++;break;
   case 'o': s=pop(s);repeat++; break;
  }
 }
 postorder(head->Left,nodenum);
 return 0;
}
 push(Tree t,int Ele)
 {
  Tree temp;
  temp=(Tree)malloc(sizeof(struct TreeNode));
  temp->Element=Ele;
  temp->Left=NULL;
  temp->Right=NULL;
  temp->Fa=t;
  temp->pop=0;
  if((k!=1))
  {
        t->Left=temp;
  k=0;
     return temp;
  }
  else
  {
   t->Right=temp;
   k=0;
   return temp;
  }
 }
 pop(Tree s)
 {
  k=1;
     if(s->pop==0)
  {
   s->pop=1;
   return s;
  }
  else 
  {
   while(s->pop!=0)
    s=s->Fa;
   s->pop=1;
   return s;
  }
 }
 postorder(Tree s,int nodenum)
 {
  if(s->Left!=NULL)
  postorder(s->Left,nodenum);
     if(s->Right!=NULL)
  postorder(s->Right,nodenum);
  visit(s,nodenum);
  return 0;
 }
 visit(Tree s,int nodenum)
 {
  if(a==0)
  {
     printf("%d",s->Element);
  }
  else
  {
   printf(" %d",s->Element);
  }
  a++;
 }