Description
Simple Java code for Binary search Tree. The requirement as folows:
Must show four traversals, Insert and Delete operation as well. Must show the calling of the traversals in the coding. Can use linked list or array list. Thanks.
PreOrder – 8, 5, 9, 7, 1, 12, 2, 4, 11, 3
InOrder – 9, 5, 1, 7, 2, 12, 8, 4, 3, 11
PostOrder – 9, 1, 2, 12, 7, 5, 3, 11, 4, 8
LevelOrder – 8, 5, 4, 9, 7, 11, 1, 12, 3, 2
