用二叉链表作存储结构

(1)以回车(‘\n’)为输入结束标志,输入数列L，分别生成一棵二叉排序树T和平衡的二叉排序树BT ；

(2)对二叉排序树T作中序遍历，输出结果；

(3)输入元素x,查找二叉排序树T:若存在含x的结点,则删除该 结点,并作中序遍历(执行操作2)；否则输出相关信息；

(4)分别计算T、BT的查找成功的平均查找长度,输出结果；

-List for storage with the two fork structures (a) to carriage return ( ' \ n' ) for the input end of the symbol, enter the number of columns L, respectively, generating a binary sort tree T and balanced binary sort tree BT　(2) right two binary sort tree T in order to make traversal, the output results　(3) input element x, to find two binary sort tree T: if there exists node containing x, then delete the node, and for medium-order traversal (to perform operations 2 )　otherwise, the output-related information　(4) were calculated T, BT Find the average successful search length, the output results