Data Structure Visualization - B-Tree (Proactive Split/Merge)

Recommendation

Has Potential

Link

http://www.cs.usfca.edu/galles/visualization/download.html

Delivery Method

Java Application

License

Unlicensed Sourcecode

Language

English

Author

David Galles

Institution

University of San Francisco

Project

Data Structure Visualization

RelationshipToProject

PartOfProject

Works

Yes

Description

Demonstrates the behavior of a B-Tree of degree 4. Users give data values to insert, find, and delete.

Evaluation

There is no code or explanation of what is happening. Users do not control the degree of the tree. When an insert or delete is initiated, an animation takes place of the various split or merge steps. The user cannot control this (aside from the overall animation speed). Thus, it can be difficult to follow the details of what is happening.

ActivityLevel

Animation Only; User Data

GoodFor

Lecture Aid; Debugging

Screenshots

Videos

References

HowToUse

First Visited

2006-09-01

Last Visited

2008-07-01

Last Updated

2006-04-05

Topic

B-Trees

Community

Average rating: unrated
Your rating:You must be logged in to Rate.
Comments

Edit

You may edit this entry if you have an account.