Introduction - If you have any usage issues, please Google them yourself
binary tree operation, grasp the meaning indicator variables, binary tree structure, and the various characteristics of the memory structure and scope of use; Description pointer types, visits and handling binary tree arithmetic. Procedure 1 : first order input sequence binary tree node values (a character), `0` empty tree. Generation of two binary tree storage structure of the binary tree, a root node to point to the target. Then click the order binary tree traversal sequence. Algorithm : A visit to the left sub-tree, and then visit root node, right-final visit to the tree.