(1)以回车(‘\n’)为输入结束标志,输入数列L，分别生成一棵二叉排序树T和平衡的二叉排序树BT ； (2)对二叉排序树T作中序遍历，输出结果；-(1) a carriage return (' \ n' ) for the input end of the symbol, enter the series L, respectively, generate a binary sort tree T and balanced binary sort tree BT　(2) of the binary sort tree T for the traversal, output