Data structure----tree, binary tree----C + + && python

Tree structure, especially the two-fork tree structure is often encountered in the algorithm, here according to the learning process to do a summary.

The knowledge points involved in binary tree are as follows: Full two fork tree and complete binary tree, node number relationship, node number and two fork tree height, hierarchical traversal, depth-first traversal, breadth-first traversal, and so on.

Here the basic structure of the two-fork tree implements the C + + version as well as the Python version of the code, and implements the pre-and post -sequence traversal of the two-fork tree and the process of creating a unique binary tree in the pre-and post-sequence sequences .

1. C + + version implementation

Basic structure:

Http://www.cnblogs.com/elleniou/archive/2012/05/03/2480042.html

Http://www.cnblogs.com/xunmengyoufeng/p/3556610.html

http://blog.csdn.net/wklken/article/details/6315549

Data structure----tree, binary tree----C + + && python