write a program that implements binary tree traversal using preorder traversal inorder traversal and postorder traversal to produce a linear arrangement of the nodes. Program input consists of the root nodes and its left and right subtrees.

the output should list the following information

1. the left and right substrees of each node (show null if none) 2. the root of the tree 3. preorder traversal 4. inorder traversal 5. postorder traversal

Example

Input:

(A,B,E) (this means A is the root, B is the left subtree, and E is the right subtree) (B,C,null) (this means B is the root, C is the left subtree, and there is no right subtree) (C,null,D) (E,F.H) (F,null ,G) (H, I , J ) OUTPUT:

Node L-Subtree R-Subtree A B E B C null C null D E F H F null G H I J

Root of the Tree: A Preorder Traversal: A B C D E F G H I J Inorder Traversal: C D B A F G E I H J Postorder Traversal: D C B G F I J H E A ps: PLEASE DO IT IN C LANGUAGE