Introduction - If you have any usage issues, please Google them yourself
(1) Enter the character sequence to build binary list. (2) first order, in sequence, after the binary tree traversal: recursive algorithm. (3) traversal of a binary tree: non-recursive algorithm. (Preferably also able to achieve the first sequence, after the non-recursive algorithm) (4) binary tree of height. (5) the number of tree leaves. (6) With the level of a binary tree traversal queue. (7) in the main function to design a simple menu, respectively debugging the above algorithm.