Draw the tree on a separate sheet of paper and then label each internal node v with a pair (i, s), where i is the rank of v in the postorder traversal of T and s is the disk space used by the directory associated with v.