C + + Implementation two fork tree notes (Template implementation) (iii)

Learn the knowledge of the tree, simple to do a record, just the basic listing and implementation.

Binary tree is a special form of tree, each node has about two subtrees trees. About the basic concept: degrees, height (depth), and full two-fork tree (special complete binary tree), complete binary tree.

1. Data storage structure for binary tree: Sequential storage and chained storage.

Sequential storage is better suited to a full binary tree, otherwise wasted storage space. So the chain storage structure is more common.

2. Basic operation of two-fork tree:

Determine its height, number of elements, copy, print, delete and other basic operations, such as printing, copying these operations can be done by traversing the binary tree.

3.c++ Template Code implementation:

See Github:https://github.com/liuamin/bitree/tree/master

C + + Implementation two fork tree notes (Template implementation) (iii)