Data Structure Visualization - B-Tree (Proactive Split/Merge)
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
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. |
||||
Animation Only; User Data |
|||||
Lecture Aid; Debugging |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-01 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
