20162314 Experiment 4 - Graph

Experiment report of Besti

course：《Program Design & Data Structures》

Class： 1623

Student Name： Wang, Yixiao

Student Number：20162314

Tutor：Mr.Lou、Mr.Wang

Experiment date：2017.11.19

Secret level： Unsecretive

Experiment time：60 minutes

Major/Elective：Major

Experiment order：4

Experiment content

1. Graph implement and apply-1
   

1. Graph implement and apply-2
   

3.Graph implement and apply-3

Experiment situation

Exp1 Graph implement and apply-1

• It‘s easy to finish this experiment.
• To start with , import to form a new LinkedBinaryTree to start the experiment.
• Next , use the method GetRight GetLeft to ealuation.
• Then , new element "ABC".
• Last , Assert.assertequals();

Exp2 Graph implement and apply-2

• To start with , use the number to replace "A B C D ....."
• Next , new newNode
• Then, creat BinTree to get left child and right child
• Use three methods preOrderTraverse,inOrderTraverse,postOrderTraverse.

Exp3 Graph implement and apply-3

• To start with , creat a class TwentyQuestionsPlayer
• String the Questions and the answers as the order
• New them
• Write a method play(),Yes =Y , No=N .
• Next , write a function to finish this experiment.

Code hosting

PSP5.1(Personal Software Process)