Explain why performing a rotation in an n-node binary tree when using the arraybased representation of Section 8.3.2 takes(n) time.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.