Description: Binary Tree is n (n> = 0) a finite set of nodes, it is empty or tree, or the root node, plus a so-called two trees are called the left subtree and right subtree are not mutually intersection of binary components. For binary operations are: the establishment of a binary tree the binary tree traversal binary tree of depth, and other nodes. 1. Define the type of binary list 2. To achieve binary tree basic operations: establishment, after the first traversal, traverse the level and output.
To Search:
File list (Check if you may need any files):
tree
....\二叉树.cpp
....\二叉树.doc
Download