Fix ranked set

This commit is contained in:
Lars Mueller 2021-06-11 19:39:35 +02:00
parent 048eaac333
commit e5ac7aa27b

@ -214,7 +214,7 @@ local function _delete(self, key, is_rank)
sidemost = sidemost[other_side]
end
-- Replace deleted key
tree.key = rightmost.key
tree.key = sidemost.key
-- Replace the successor by it's single child
parents[len][sides[len]] = sidemost[side]
else