COMP 310	Self-Balancing B-Trees using Extended Visitors Demo

Note:  it is an Honor Code violation to attempt to decompile any supplied code

See the Tooltips in the application for help on what each button does. 

The demo will show a B-Tree implemented with the Extended Visitor Design Pattern.    The demo allows you to enter specific or random numbers or sets of numbers and delete specific or random numbers or sets of numbers.  

The order (maximum number of data elements on each node) can be changed at any time.

There is also a "playback" facility that will record the numbers being inserted and will allow you to reinsert the same numbers in exactly the same order, thus allowing you to see the differences between different orders.

Click here to download and launch the demo.   Please accept any security requests.

Additional Resources:

• OOPSLA 2002 Paper by Dr. Nguyen and Dr. Wong:
  • Published paper (PDF)
  • Poster
  • PowerPoint presentation
• Extended Visitor Demo
• Traditional rotations-based 2-34 tree algorithms demo

Trouble Running the Demos?

© 2017 by Stephen Wong