Introduction - If you have any usage issues, please Google them yourself
Structure with a store on each node, each structure includes a char and a pointer to the children about each sweep into its own char and i, for even if i was into the left subtree, or else into the right sub-树. Then there is the use of recursive traversal of this tree before