Problem
1. Write a method that will traverse a linked B-tree, visiting all its entries in order traversal of keys (smaller keys first).
2. Define preorder traversal of a B-tree recursively to mean visiting all the entries in the root node first, then traversing all the subtrees, from left to right, in preorder. Write a method that will traverse a B-tree in preorder.