解释如何找到存储在B树的最小密钥以及如何找到存储在B树的给定键的predecessor ​​

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.

推荐答案

您可以编写递归函数通过每个父节点的左，右节点遍历B树（从根）。在此您可以比较所有值，找到最小和其父节点。

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.