Data structure Experiment five: tree and two-fork tree

Data structure Experiment five: tree and two-fork tree

first, the purpose of the experiment

Strengthen the knowledge of tree and two-fork tree, especially the related content of binary tree. Learn to use flexible applications.

1. The logical structure and storage method of the back tree and the two fork tree, which clearly master the traversal operation of the tree and the two fork tree.

2. Learn about tree-related knowledge to solve practical problems.

3. Further consolidate the procedure debugging method.

4. Further consolidate the template design.

Two Experimental time

Preparation time for the 10th thoughtful 12th first half week, the specific concentration experiment time is 12 weeks Thursday. 2 hours of schooling.

Three. Experimental content

1. Design a binary tree, with a depth of at least 4, please recursive algorithm using the pre-order, the middle sequence, post-sequence traversal output tree node.

2. Write a procedure to determine a counterfeit coin in six coins. Refer to the Textbook P136 page 8 coin determination method.

3. Self-determination 2n (size of their own) a classmate to participate in school Badminton Elimination competition, please set procedures, store the results of the players, and according to the results to determine the Crown runner-up. All

The first question is a must , the second and the third choice to do the problem. Choose and do the right to reward 5 points per title.

Source:

Data structure Experiment five: tree and two-fork tree