Show That The Expected Depth Of The Kth Smallest Element

Show that the expected depth of the kth smallest element in a large complete heap (you may assume N = 2k − 1) is bounded by log k.

Posted in Uncategorized