Algorithms In Action - 2,3,4 Tree
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Linda Stern; Lee Naish; Harald Sondergaard |
||||
Institution |
University of Melbourne |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Demonstrates building a particular variant of a 2,3,4 Tree (B-Tree of order 4). Note that this demonstration is rather specific to 2,3,4 Trees, and can't really be viewed as a "typical" instance of how B-trees work in general. In particular, the rules for pre-splitting internal nodes on the way down during an insertion are specific to the 2,3,4 Tree. |
||||
Evaluation |
Sophisticated use of pseudocode, that can expand to show more or less detail. Has an explanation window for how the data structure works. Slightly limited in that it doesn't support delete, but does a good job at what it does support. As an extra bonus, you can pop open another window that shows the corresponding Red Black Tree (though with no pseudocode or explanation). |
||||
Animation; Step Control; Canned Data; Random Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-02 |
||||
Last Visited |
2008-11-17 |
||||
Last Updated |
2000 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
