Optimal Binary Tree – given a set S of tuples , where k is an integer and freq[k] is the number of times that k has been observed, build a binary search three such that the total cost of all single searches is minimized