Recommendation

Recommended

Link

http://ww2.cs.mu.oz.au/aia/demoindex.html

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Linda Stern; Lee Naish; Harald Sondergaard

Institution

University of Melbourne

Project

AlgorithmsInAction

RelationshipToProject

PartOfProject

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).

ActivityLevel

Animation; Step Control; Canned Data; Random Data

GoodFor

Lecture Aid; Self Study

Screenshots

Videos

References

HowToUse

The link above takes you to the AIA demonstration index page. Click on the link to the desired AV, and it should load in your browser as a multi-paned Java applet. Note that the level of detail shown in the visualization is directly tied to the level of detail that you choose to expose in the pseudocode pane.

First Visited

2008-07-02

Last Visited

2010-02-10

Last Updated

2000

Topic

B-Trees

Community

Edit

You may edit this entry if you have an account.