Introduction - If you have any usage issues, please Google them yourself
1, used as a binary linked list storage structure, the establishment of a binary tree. 2, respectively, according to first order, in sequence and post-order tree traversal, the output of the traversal sequence. 3, prepared by the exchange of binary tree all nodes about their children s non-recursive algorithm. Tip: after the traversal can be based on methods, to achieve the exchange of binary tree nodes around each child.