The Power and Limitations of Static Binary Search Trees with Lazy Finger

Prosenjit Bose, Karim Douïeb, John Iacono +1

A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic o…