Java Applets Centre
2-3 Tree (Insert)


Description
This applet demonstrates the bottom-up construction of a 2-3 tree. Being a balanced tree, the operations of search and insert take O(log n) time. Only values between 1 and 99 are allowed. Duplicate entries are not allowed.


Data Structures and Algorithms
Java Applets Centre


R. Mukundan
Department of Computer Science
University of Canterbury
Private Bag 4800, Christchurch
New Zealand.