Algorithms In Action - 2,3,4 Tree


Collection:   AlgoViz
Source: http://algoviz.org/node/486
Format: Java Applet, application/x-java-vm

Recommendation: Recommended.
Description: Demonstrates building a particular variant of a 2,3,4 Tree (B-Tree of order 4). This AV is specific to 2,3,4 Trees and shouldn't beviewed 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 detail. An 'Explanation window' describes how the tree works. The AV does not support the 'delete' op; it supports everything else well. As an extra bonus, you can pop open another window that shows the corresponding Red Black Tree (without pseudocode or explanation).

Creator(s):
Publisher:   University of Melbourne
Subject: B-trees, 2-3-4 trees, B-Tree, 2-3-4 Tree
Relation: Algorithms In Action
Language: english
Rights: Available but unlicensed
Audience: Educator, Learner, Professional/Practitioner, Researcher
Education Level: Higher Education
Material Type: Instructional Material, Tool


Average: 1 (1 vote)
feedback