- Category:
- Other systems
- Tags:
-
- File Size:
- 2kb
- Update:
- 2018-02-12
- Downloads:
- 0 Times
- Uploaded by:
- 奥谢特
Description: In computer science, a two tree is a tree structure with a maximum of two subtrees for each node. Usually subtrees are called "left subtree" and "right subtree". Two forked trees are often used to implement two fork search trees and two forked heaps. The thought, depth, height of the two forked tree and the traversal of the two forked tree have deeply affected the development of computer science.
This time, we use the two fork tree to realize the word that read a file, then build a two fork search tree, then output the height of two fork search tree, Ye Zishu and other information, and achieve the order traversal. Using a two fork search tree, a large number of words can be quickly arranged and the performance is very high.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| searchBinTree | 0 | 2016-12-17
|
| searchBinTree\binTree.c | 439 | 2016-12-17
|
| searchBinTree\binTree.h | 357 | 2016-12-17
|
| searchBinTree\handle.c | 939 | 2016-12-17
|
| searchBinTree\main.c | 1235 | 2016-12-17
|
| searchBinTree\makefile | 186 | 2016-12-17
|
| searchBinTree\output.txt | 244 | 2016-12-17
|
| searchBinTree\tst.txt | 43 | 2016-12-17 |
Download