Explain how to find the minimum key stored in a B-tree and how to find the predecessor of a given key stored in a B-tree.
You can write recursive function to traverse a B-tree (from the root) via left and right nodes of each parent node. During this you can compare all values and find minimum and its parent node.