... HIRE-ASSISTANT always hires candidate 1, it hires exactly once if and onlyif no candidates other than candidate 1 are hired. This event occurs when candi-date 1 is the best candidate of the n, which occurs ... d.k/, let RT and LT be T ’s right and left subtree, respecitvely, and let i be the number of leaves in RT . Thenk i is the number of leaves in LT and d.k/ D D.T / (by choice of T )D D.RT ... for each such value of n and determine a value of c for which 3 < cx for all values of n. The final value of cthat we use is the larger of 6, which works for all n n0, and max3n<n0fc...