B-tree: minimum
General Information
Algorithmic Problem:
Type of algorithm: loop
Auxiliary data: A pointer p of type "pointer to a B-tree node".
Abstract View
Pseudocode
Minimum(x)
1 :while leaf(x) = false
2 ::x = c1(x)
3 :return key1(x)
Algorithmic Problem:
Type of algorithm: loop
Auxiliary data: A pointer p of type "pointer to a B-tree node".
Minimum(x)
1 :while leaf(x) = false
2 ::x = c1(x)
3 :return key1(x)