Binary Search Tree ( BST )

BinaryTree.java

BinarySearchTree.java

MainProgram.java

Sample Running :

1-Manual input or 2-Random

>2

How many time the system need to loop  :

>10

Start.....

>Insert 18

>Delete 77

>Delete 59

>Insert 30

>Delete 70

>Delete 63

>Delete 23

>Insert 67

>Delete 91

>Delete 40

Tree Information :

Height       : 3

No. of leave : 1

No. of node  : 3

Preorder :

18 30 67 

Inorder :

18 30 67 

Postorder :

67 30 18 

you can test it by your self..

i hope you like this souce code...

and please give some comment....

                                                                                                                                                      Created By : Z-man, 2013