Java

Lab-BTrees Part #1 : BTrees Write a program that creates a B-tree with a storage size of six. Once the tree reaches a size of six, it will split into two nodes (and a root). Items one and two will remain in the first node, item three will be stored in the root node and items four through six will be stored in a second node. Use Arraylist