next up previous
Next: 4.5.1 Search, Insert, Delete in Bottom-up Splaying Up: 4. Binary Trees Previous: 4.4.1 Average Case Analysis of BST Operations

4.5 Splay Trees

REF.
Daniel D Sleator and Robert E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, Volume 32, Number 3, pp. 652-686, 1985.

REF.
Robert E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, Volume 6, Number 2, pp. 306-318, 1985.



 
next up previous
Next: 4.5.1 Search, Insert, Delete in Bottom-up Splaying Up: 4. Binary Trees Previous: 4.4.1 Average Case Analysis of BST Operations
eEL,CSA_Dept,IISc,Bangalore