Introduction - If you have any usage issues, please Google them yourself
(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