Introduction - If you have any usage issues, please Google them yourself
The binary tree is used to sort a series of integers and traverse them in the order of preceding, middle and post.
There may be multiple sets of test data. For each set of data, a binary sorting tree is established for the data given by the title, and the binary sorting tree is traversed in order of precedence, middle order and post order. Each traversal result outputs one line. There is a space after the last data in each row.