This is a preview. Log in through your library . Abstract This paper studies path lengths in random binary search trees under the random permutation model. It is known that the total path length, when ...

An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...

Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However inserting ...