(Picture above is Figure 18.8(a)) predecessor(x, k): x points to a node containi

Question

(Picture above is Figure 18.8(a))

predecessor(x, k): x points to a node containing a key k. The function returns the predecessor key of k; it returns Nil if the predecessor of k does not exist in the tree. For example, in the B-tree in Figure 18.8 (a), the predecessor of P is O and the predecessor of Q is P.

Note that the predecessor of k is interpreted as the key immediately preceding k in the implicit ordering in the tree. So the predecessor of k may be equal to k if the tree has multiple occurrences of k. In case the predecessor of k is interpreted as the largest key less than k, the above algorithm needs to be modified to skip the multiple occurrences of k, please resolve this

Explanation / Answer

predecessor(x, k) { let k = x.keyi; if ( !x.leaf ){ // x is not a leaf s: let temp= largestKey(x.ci); // return the largest key in the subtree pointed to by ci if(temp

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.