1. Show how red-black trees can represent (2,3)-trees with insert w/o preventive splitting.
  2. Show LLRB-tree implementation of the following operations:
  • Removal of minimum
  • Removal of maximum
  • Delete operation.
Modifié le: mercredi 15 avril 2020, 19:31