a question about c-sharp-algorithms HOT 2 CLOSED

Hello @hwgeone,

Sorry for the late reply. When deleting a tree node that has children it we need to rebalance that branch after deletion, as that node could be linking to a big sub-tree and not just leaf nodes. Regardless of the size of the subtree that the delete operation will mutate, we need to find the next larger element in that subtree in order to find the new root for that subtree, this doesn't mean that we will end up with the largest number in the entire subtree but the next bigger one after the one we're deleting. When we find it we will mark it as the new root of the subtree and then try to re-balance the tree around it.

I hope this makes it clearer for you.

Cheers,
Ahmad

from c-sharp-algorithms.

Hello @hwgeone,

I will close the issue for now, if you think this is really a bug, please reopen it with, preferably, a failing unit test to prove that there is a bug.

Cheers,
Ahmad

from c-sharp-algorithms.