Java Applets Centre - Binary Search Tree
|
- Description
- This AV allows users to perform Insert, Search and Delete Operations in a Binary Search Tree. User can either pick a new value to insert/search/delete, or pick a random value. Nodes are highlighted as they are visited during the operations. A small description provided along with search code snippet. The code snippets are however not traced though as the algorithm works. This site as a second AV for just BST search which is not at all useful.
- Evaluation
- No explanation of what is happening during the operations. Visualization good enough only for beginners and for simple trees. The visualization doesn’t work for trees of height greater than 5. Moreover, when the user tries to insert an element which would lead to a tree of height greater than 5, no message is displayed stating that the visualization doesn’t support dynamic layout of the graphs. No message displayed upon the end of search and delete operations. Similarly, no message is displayed when an element is inserted/deleted.
- Usage Notes
- Field Report(s)
- References
- N/A
- AV of the Day
- No
- Score
- 15
