Introduction - If you have any usage issues, please Google them yourself
1) the establishment of a first-order sequence shown in the figure below two binary tree insert list, take junction element type character, the character sequence input the keyboard by one tree. 2) In the first step 1) to establish a good binary tree implementation of the pre-order list, sequence and subsequent recursive traversal, and outputs a corresponding traversal sequence. 3) the establishment of a good list before binary tree traversal implementation leaf node output and the number of statistics in the first step 1). 4) Establish the first step 1) good binary tree list in order to implement the non-recursive traversal, and outputting a corresponding traversal sequences (OPTIONAL) 5) sequence of clues 1) Step list established by the binary tree, in preorder established threaded binary and output through the results (OPTIONAL)