Description: 1. Preparation of building a binary sort tree procedures and the use of a set of data to verify. 2. The realization of the binary sort tree search algorithm to calculate a set of input data to find the length. 3. The establishment of procedures to build a balanced binary tree to calculate a set of input data to find the length. Procedures to implement the order include: (1) enter the binary search tree structure of the file name to construct the binary sort tree (2) input to Find the file name (3) by the computer terminal display all the data to find the length and the total length of the search, to find the length of the average (4) end
To Search:
File list (Check if you may need any files):
二叉排序树
..........\Application.h
..........\BST.c
..........\text1.txt
..........\text2.txt
Download