A Java applet that animates insertion into B+ trees.
This is a self-directed group project for CISC 235 - Information Structures (Winter 1997) taught by David Alex Lamb at Queen's University.
Informally, a B+ tree is an n-ary tree with n variable but large (often >100).
A B+ tree of order v consists of a root, internal nodes and leaves. The root my be either leaf or node with two or more children. Internal nodes contain between v and 2v keys, and a node with k keys has k + 1 children. Leaves are always on the same level. If a leaf is a primary index, it consists of a bucket of records, sorted by search key. If it is a secondary index, it will have many short records consisting of a key and a pointer to the actual record.
Insert elements as before. Build yourself the tree you've always dreamed of!
To use this applet, paste the following into your html document:
The width, height, vspace and hspace may be adjusted to suit your web page. The elements parameter specifies the
set of records that the tree will start out with; you may include as many as you want or leave this parameter out entirely.
The defaults parameter specifies the values initially appearing in the text entry boxes. It may also be left out.
The Java source code is available here.
Our Bookmarks of B+ Tree and Java WWW Resources