234
click to vote
CIAC
16 years 3 days ago
1994 Springer 
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
|
Algorithms