The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

Animated Binary Tree

Link(s)
http://www.cs.jhu.edu/~goodrich/dsa/trees/btree.html
Topic(s)
Binary Search Tree, Search Structures

Screenshots
Animated BST, ready for deletion


Recommendation
  
Lecture Aide Has Potential
Self-study Supplement Has Potential
Standalone Not Recommended
Debugging Aide Has Potential
Works?
Yes
Delivery Method(s)
Java Applet
Project
Goodrich's Collection
Project Relationship
Part of collection
Language(s)
English
Author(s)
John Kloss, Michael Goodrich
Institution(s)
Johns Hopkins University
Activity Level(s)
Animation only, User data
Source Code License
Available but unlicensed
First Published
N/A
Last Modified
1997-08-05

Description

While labeled "Binary Tree", this is actually a visualization for a BST. This AV is a simple presentation for basic BST operations of insert, delete, and search. Subtle visual cues are used in the execution of each function. Type in numbers, you see the result of the operation.  Note the light, shaded circle behind each data object as the functions execute, which helps to demonstrate the algorithm by showing that path that takes place.  

Evaluation

This visual binary search tree is mainly useful for instructors as a teaching aid when demonstrating how deletions and insertions change the tree.  However, there is no explanation or step-by-step animation to show how each operation works, beyond tracing the path through the tree. This is especially problematic for the delete operation, which does not show how the replacment node is selected. The interface is simple to use. Only user-provided input is supported, no random or canned examples are provided. This is especially important because of the difficulty of entering a large tree — a canned demonstration of inserts and deletes in a large tree would have been helpful. The key weakness of the AV is that it is hard to get a sense of the insert or delete algorithms from merely seeing the result of an insert or delete on the structure of a tree. On some systems, you might not be able to see the light grey shading behind the current node as the algorithm progresses down the tree.

Usage Notes

Go to the link above, which opens a page containing the Java applet. Type integers to insert them into the tree.

Field Report(s)
Field Report: 1
References
N/A
Rating
2
Average: 2 (2 votes)
Your rating: None
AV of the Day
No
Score
41