JAVA: (BOOK: Data structures and algorithms 2nd edition)

FOR HELP HERE IS (10.1): 10.1 This project should be easy. Write a method that returns the minimum value in a 2-3-4 tree.

ANSWER QUESTION:

10.4 Modify the tree234.java program (Listing 10.1) so that it creates and works with 2-3 trees instead. It should display the tree and allow searches. It should also allow items to be inserted, but only if the parent of the leaf node (which is being split) does not also need to be split. This implies that the split() routine need not be recursive. In writing insert(), remember that no splits happen until the appropriate leaf has been located. Then the leaf will be split if its full. Youll need to be able to split the root too, but only when its a leaf. With this limited routine you can insert fewer than nine items before the program crashes.

Please Make Sure To Use Main Method Given Below:

PLEASE MAKE SURE THE OUTPUT IS SAME AS GIVEN BELOW:

PLEASE DO IT AS SOON AS POSSIBLE. THANKS

public static void main(String[] args) throws IOException long value; Tree23 theTree new Tree23(); theTree.insert(10); theTree.insert(20); theTree.insert(30); theTree.insert(30); theTree.insert(70)