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 ...

This is a preview. Log in through your library . Abstract This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions ...