Deletion without rebalancing in balanced binary trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1490-1499

  Sen, Siddhartha ^a   Tarjan, Robert E ^a,b  

^a PRINCETON UNIVERSITY   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

ACCESS TIME; AMORTIZED TIME; AVL TREE; BALANCED BINARY TREE; BALANCED TREES; POTENTIAL FUNCTION; REBALANCING;

BINARY TREES;

EID: 77951668554     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.121     Document Type: Conference Paper

References (20)

1. L. A. Adamic and B. A. Huberman. Zipf's law and the Internet. Glottometrics, 3:143-150, 2002.
2. G. M. Adel'son-Vel'skii and E. M. Landis. An algorithm for the organization of information. Sov. Math. Dokl., 3:1259-1262, 1962.
3. A. Andersson. Balanced search trees made simple. In WADS, volume 709, pages 60-71, 1993.
4. R. Bayer. Binary B-trees for virtual memory. In SIGFIDET, pages 219-235, 1971.
5. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Inf., 1:290-306, 1972.
6. J. B. Estoup. Gammes stenographiques., 1916.
7. C. C. Foster. A study of AVL trees. Technical Report GER-12158, Goodyear Aerospace Corp., 1965.
8. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: a new form of self-adjusting heap. Algorithmica, 1 (1):111-129, 1986.
9. L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In FOCS, pages 8-21, 1978.
10. B. Haeupler, S. Sen, and R. E. Tarjan. Rank-balanced trees. In WADS, pages 351-362, 2009.
11. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1973.
12. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM J. on Comput., pages 33-43, 1973.
13. H. J. Olivié. A new class of balanced search trees: Half balanced binary search trees. ITA, 16(1):51-71, 1982.
14. M. A. Olson, K. Bostic, and M. I. Seltzer. Berkeley DB. In USENIX Annual, FREENIX Track, pages 183-191, 1999.
15. M. A. Olson, K. Bostic, and M. I. Seltzer. Berkeley DB, 2000.
16. R. Sedgewick. Left-leaning red-black trees. www.cs.princeton.edu/rs/ talks/LLRB/LLRB.pdf.
17. S. Sen and R. E. Tarjan. Deletion without rebalancing in B trees. 2009. In preparation.
18. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652-686, 1985.
19. R. E. Tarjan. Amortized computational complexity. SIAM J. Algebraic and Disc. Methods, 6:306-318, 1985.
20. G. K. Zipf. Selected studies of the Principle of Relative Frequency in Language. Harvard Univ. Press, 1932.