Given an n-node complete binary tree T, rooted at a given position, consider a directed graph ~G having the nodes of T as its vertices. For each parent-child pair in T, create a directed edge in ~G from the parent to the child. Show that the transitive closure of ~G has O(nlogn) edges.
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'.