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.

• Random Value: Generates a random value between 1 and 100, and inserts it into the tree.
• Insert: Inserts the value in the text field into 2-3 tree. (The text field is editable)
• Clear: Deletes the entire tree.