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

Visualisation of search trees

Link(s)
http://people.ksp.sk/~kuko/bak/
Topic(s)
AVL Tree, Binary Search Tree, Heap, Red-black trees, Splay tree, Search Structures



Recommendation
  
Lecture Aide Has Potential
Self-study Supplement Not Recommended
Standalone Not Recommended
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Java Applet
Project
Kovac's Tree Project
Project Relationship
Part of project
Language(s)
English, Slovak
Author(s)
Kubo Kovac
Institution(s)
Comenius University, Slovakia
Activity Level(s)
N/A
Source Code License
Unavailable
First Published
N/A
Last Modified
N/A

Description

This AV shows various search trees such as AVL, BST, B tree, red-black tree, AA tree, skiplist, heap, treap, scapegoat tree and splay tree. It demonstrates insertion, deletion and search. Users can start with randomly generated input dataset or user’s own data. For the data structuers where this is relevent, it provides balance factors such as ‘+’, ‘-‘ and ‘.’ by the nodes.

Evaluation

Strengths: The best feature of this tool is to provide many search trees. This may allow learners to identify how the search trees work by comparison with each other. Randomly generated dataset lets users quickly see the structure of the tree. Users can also construct their own data set. Weaknesses: Like many tree AVs, it just shows the result of the insert or delete operation, without explaining how it works. What is neeed is good textual explanation about each search structure and documentation explaining basic key concepts such as balance factors, re-balancing, etc. The text size of balance factors on the nodes is too small to be recognized (you need to use the "big" version of the applet to see them at all).

Usage Notes
N/A
Field Report(s)
References
N/A
Rating
4.666665
Average: 4.7 (3 votes)
Your rating: None
AV of the Day
No
Score
28