B-tree: minimum: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
== General Information == | == General Information == | ||
'''Algorithmic Problem:''' | |||
'''Type of algorithm:''' loop | |||
'''Auxiliary data:''' A pointer p of type "pointer to a B-tree node". | |||
== Abstract View == | == Abstract View == | ||
Revision as of 11:39, 2 October 2014
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)