- [x] ~Evaluate whether `instanceof` checks are faster than `isLeaf()` calls.~ Not necessary since we do not use Leaf anymore. - [ ] Rewrite `delete_caseX` cascade to forward precomputed sibling. - [x] ~Find out whether dummy Leaf nodes `_color` field can be removed.~ Not necessary since we do not use Leaf anymore. - [x] Find out whether dummy Leaf nodes can be easily replaced by null (see #104). - [ ] Rewrite `insert_caseX` cascade to forward precomputed grandparent, potentiall rewritting `uncle = (n) => _uncle(n, grandparent(n));` - [ ] Break tail recursion of delete_caseX and insert_caseX cascades somehow.
Evaluate whetherNot necessary since we do not use Leaf anymore.instanceofchecks are faster thanisLeaf()calls.delete_caseXcascade to forward precomputed sibling.Find out whether dummy Leaf nodesNot necessary since we do not use Leaf anymore._colorfield can be removed.insert_caseXcascade to forward precomputed grandparent, potentiall rewrittinguncle = (n) => _uncle(n, grandparent(n));