readme.txt

数据结构基础（ C）： splay 树； BS 树； AVL 树

Guidence:

For each tree test, the elements in the tree node are non-negative integers, the number
of the nodes is no more than 10001.   
    The programme will read in the test numbers in a "input.txt",and for the convenience
of time caculation does the operation for 100 times ,then the time used will be listed in 
the"output.txt". If the tree is not deleted to empty, a result of the inorder traversal of the 
tree left will be also included in the "output.txt".    
    Each test will start with an interger n, the times of insert operation(also delete operation),
then you input a n-series intergers, seperated by a space; then they will all be inserted into the 
tree in sequence.Afterwards,another n-series intergers,seperated by a space;they will be deleted from
the tree. The whole process will run 100 times ,the tatal time used will be print out.
    NOTE:Wrong operation will be notified out in this process, for example, if you delete a integer which is 
not in the tree ,"CAN"T DELETE N" will be showed out.