Download the code that implements B-trees and extend it in the following ways:
(50 %) Using the draw tree method for binary search trees as guide, write a method to display a B-tree given a reference to its root.
(50 %) Write methods that perform the following operations:
Extract the items in the B-tree into a sorted array.
Return the minimum element in the tree at a given depth d.
Return the maximum element in the tree at a given depth d.
Return the number of nodes in the tree at a given depth d.
Print all the items in the tree at a given depth d.
Return the number of nodes in the tree that are full.
Return the number of leaves in the tree that are full.
Given a key k, return the depth at which it is found in the tree, of -1 if k is not in the tree.
Given a key k, print all the keys that are in the same node as k.
As usual, write a report describing your work.
