🚀 go-pugleaf

I am posting this for a friend of mine who does not have access to the net. 
If anyone has suggestions, please mail me. 

We can represent each node in a binary tree by
 

          type node
                =record
                 value=integer;
                 link =^node;
                 Rlink=^node;
                 end;

My friend wants procedures 

1. to create a binary tree from a file which contains an inorder and 
post order sequences of a tree T

2. list all the leaf nodes of the tree T.

3. to delete a node S from a binary tree T.

4. list the data files of the nodes of the binary tree T by level.  

Thanks.