B-tree: minimum: Difference between revisions
Jump to navigation
Jump to search
| Line 11: | Line 11: | ||
== Pseudocode == | == Pseudocode == | ||
<code> | <code> | ||
Minimum(x) | Minimum(''x'') | ||
1 | 1 '''while''' leaf(''x'') = false | ||
2 | 2 ''x'' = c_1(''x'') | ||
3 | 3 '''return''' key_1(''x'') | ||
</code> | </code> | ||
Revision as of 11:42, 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 = c_1(x)
3 return key_1(x)