Implement a deletion method, which deletes a node x by rotating it down the tree until it has at most one child, when it can be easily deleted. At each step rotate about x a child that is the root of a subtree that is deeper than the subtree rooted at the other child. Consider using a variant in which a child to be rotated about x is the root of a subtree with a larger number of nodes than the subtree rooted at the other child. The height of a subtree or the number of nodes should be computed upon deletion (cf. exercises and in section).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.