I need help coding an ordinary BST data structure in Java from scratch without using BST library package. The coded BST should be able to do the following operations- *create() – produces an empty BST *search() – determines if a search key exists in the BST *insert() – adds a new node in the BST *destroy() – The BST will become empty after calling destroy(). Note this BST is mainly for string keys and not integers
I need help coding an ordinary BST data structure in Java from scratch without using BST library package. The coded BST should be able to do the following operations-
*create() – produces an empty BST *search() – determines if a search key exists in the BST *insert() – adds a new node in the BST *destroy() – The BST will become empty after calling destroy().
Note this BST is mainly for string keys and not integers
Step by step
Solved in 3 steps with 1 images