Problem
Given a complete binary tree T with n nodes, 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(n log n) edges.