Solutions to exercises and problems from "Introduction to Algorithms", Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein (in Polish)
The key's predecessor means the nearest little key to the given key in B-tree. If we want to try to find the predecessor of the giving key stored in a B-tree, we should follow these steps:
Firstly we should find the position of this key.
Then, we check whether this key has the left child or not.
If it has, we will find the largest key among these keys which are located on the left of the given key.
If this key doesn't have the left child, we will go up one level and try to find the predecessor inside the same node which is the nearest one to the given key from the left.
Sprawdzić poniższy opis dla operacji poprzednika: