Problem:
Tree Walk

Binary trees are defined recursively. A binary tree T is a structure defined on a finite set of nodes that either

contains no nodes, or

is composed of three disjoint sets of nodes:

- a root node.

- a binary tree called its left subtree.

- a binary tree called its right subtree.

Your task is to write a program which perform tree walks (systematically traverse all nodes in a tree) based on the following algorithms:

Print the root, the left subtree and right subtree (preorder).

Print the left subtree, the root and right subtree (inorder).

Print the left subtree, right subtree and the root (postorder).

Here, the given binary tree consists of n nodes and evey node has a unique ID from 0 to n-1.

Input

The first line of the input includes an integer n, the number of nodes of the tree.

In the next n linen, the information of each node is given in the following format:

id left right

id is the node ID, left is ID of the left child and right is ID of the right child. If the node does not have the left (right) child, the left(right) is indicated by -1

Output

In the 1st line, print "Preorder", and in the 2nd line print a list of node IDs obtained by the preorder tree walk.

In the 3rd line, print "Inorder", and in the 4th line print a list of node IDs obtained by the inorder tree walk.

In the 5th line, print "Postorder", and in the 6th line print a list of node IDs obtained by the postorder tree walk.

Print a space character before each node ID.

Constraints

1 ≤ n ≤ 25

Sample Input 1

9
0 1 4
1 2 3
2 -1 -1
3 -1 -1
4 5 8
5 6 7
6 -1 -1
7 -1 -1
8 -1 -1

Sample Output 1

Preorder
0 1 2 3 4 5 6 7 8
Inorder
2 1 3 0 6 5 7 4 8
Postorder
2 3 1 6 7 5 8 4 0

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in JAVA (judge verdict: Wrong Answer)


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

class Main {

	static long changecount = 0;
   public static void main(String args[]) throws IOException{

	   Scanner sc = new Scanner(System.in);
	   BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	   int n = Integer.parseInt( br.readLine()  );


       Tree tree = new Tree(n);


	   for(int i = 0;i < n; i++){
		   String[] string = br.readLine().split(" ");
		   tree.Nodes[ Integer.parseInt(string[0]) ].input_nood_number( Integer.parseInt(string[0]) );
           tree.Nodes[ Integer.parseInt(string[0]) ].input_root_number(string , tree );
	   }


        //tree.printtree();

	   System.out.println("Preorder");
	   System.out.print(" ");
        tree.preorder_walk(tree.highnode_choice(), 0  , tree.rightside_choice());
       System.out.println("Inorder");
        tree.inorder(tree.Nodes[0]);
        System.out.println("");
        System.out.println("Postorder");
        tree.Postorder (tree.Nodes[0]);
        System.out.println("");
	   sc.close();
   }


}



class Node{

	int nood_number = 0;




    Node parent = null;
    Node right = null;
    Node left = null;
    boolean pass = true;


    void input_nood_number(int date){
    	nood_number = date;
    }


    void input_root_number(String[] string, Tree tree ){



       if( Integer.parseInt(string[1]) !=-1 ){
    	  left = tree.Nodes[ Integer.parseInt(string[1]) ];

          tree.Nodes[ Integer.parseInt(string[1]) ].parent = this;

        }

       if( Integer.parseInt(string[2]) !=-1 ){
     	  right = tree.Nodes[ Integer.parseInt(string[2]) ];

           tree.Nodes[ Integer.parseInt(string[2]) ].parent = this;

         }


    }


     int child_num(){

    	 if( right == null && left == null){
    		 return 0;
    	 }
    	 else if(right != null && left != null){
    		 return 2;
    	 }
    	 else{
    		 return 1;
    	 }


     }

     int node_depth(Node[] nodes , int number){
	     int depth = 0;


         for(Node tmp = this; tmp.parent != null; depth++){
        	 //System.out.println(nodes[number].parent.nood_number);
        	 tmp = tmp.parent;

         }

	     return depth;
    }

     int height_node(Node node , Node[] nodes)
     {
       if (node == null) return 0;
       if(node.left == null&& node.right == null) return 0;

       int a = height_node( node.left, nodes);
       int b = height_node( node.right, nodes);
       return 1+(a > b ? a : b);
     }


     int parent_node( )
     {
       if (parent == null) {return -1;}
       else{
    	   return parent.nood_number;
       }
     }

     String node_type(){

    	 if(parent == null ){

    		 return "root";

    	 }else if( parent != null && (right != null || left != null )    ){

    		 return "internal node";

    	 }else{

    		 return "leaf";
    	 }



     }

}

//Integer.parseInt(string[2+i])

class Tree{

	Node[] Nodes = null;
    int allnode_num = 0 ;

    Tree(int n){
    	allnode_num = n;
    	Nodes = new Node[n];
    	for(int i = 0; i < n ; i++){
    		Nodes[i] = new Node();
    	}

    }

    int brother_find(Node node , int n ){
    	int brother_number = -1;


        if(node.parent != null){

        	if( node.parent.left == node && node.parent.right != null){
        		return node.parent.right.nood_number;

        	}else if(node.parent.right == node && node.parent.left != null ){
        		//System.out.println("check");
        		return node.parent.left.nood_number;
        	}


        }



        return brother_number;
    }


    void preorder_walk(Node start , int i , Node last){

        if( start != last ){

          if( start.pass ){
        	System.out.print(start.nood_number+" ");
        	start.pass = false;
          }
           if(start.left != null && start.left.pass){
    		 //System.out.println(" left "+start.nood_number+" i="+i);
    		 preorder_walk(start.left , i++, last);

    	  }
    	  else if(start.right != null && start.right.pass){
    		//System.out.println(" right "+start.nood_number+" i="+i);
    		preorder_walk(start.right , i++, last);
          }
    	  else{
    		 // System.out.println("non way"+start.nood_number+" i="+i +" parent="+start.parent.nood_number);
    		  preorder_walk(start.parent , i++, last);
    	  }

        }
        else{
        	 System.out.println(start.nood_number);
        }

    }

    void inorder (Node tree) {
    	         if (tree != null) {
    	           inorder(tree.left);
    	            System.out.print(" " + tree.nood_number);
    	            inorder(tree.right);
    	        }
     }


    void Postorder (Node tree) {
        if (tree != null) {
          inorder(tree.left);
          inorder(tree.right);
          System.out.print(" " + tree.nood_number);
       }
}

    Node highnode_choice(){

    	Node start = Nodes[0];

    	for(int i = 0, maxheight = Nodes[i].height_node(Nodes[i], Nodes) ; i < allnode_num; i++){

    		if( maxheight < Nodes[i].height_node(Nodes[i], Nodes) ){

    			maxheight = Nodes[i].height_node(Nodes[i], Nodes);
    			start = Nodes[i];

            }


    	}

        return start;

    }


    Node rightside_choice(){

    	Node start = Nodes[0];

    	for(; start.right != null;){
            start = start.right;
    	}

        return start;

    }

   void printtree(){

	   for(int i = 0; i < allnode_num ; i++){
		   //System.out.print("nood_number="+Nodes[i].nood_number+" root_sum="+Nodes[i].root_sum+" parent_number="+Nodes[i].parent_number);
		   //System.out.println(Nodes[i].node_depth(Nodes, i));
		  // System.out.println("node "+i+": parent = "+Nodes[i].parent_number+", depth = "+ Nodes[i].node_depth(Nodes, i)+", " +Nodes[i].node_type() +", ["+Nodes[i].print_root()+"]" );
		    //System.out.println("node "+i+": parent = "+Nodes[i].parent_node() +", sibling = "+ brother_find(Nodes[i], allnode_num) );
		   //System.out.println("node "+i+ ": parent = "+Nodes[i].parent_node() +", sibling = "+ brother_find(Nodes[i], allnode_num) + ", degree = "+Nodes[i].child_num() + ", depth = "+Nodes[i].node_depth(Nodes, i)+", height = "+Nodes[i].height_node(Nodes[i], Nodes) + ", "+ Nodes[i].node_type() );
          //
   	   }

   }







}