EFFICIENT ALGORITHMS TO GLOBALLY BALANCE A BINARY SEARCH TREE

被引：21
|
作者：
CHANG, H
IYENGAR, SS
机构：
来源：
COMMUNICATIONS OF THE ACM | 1984年 / 27卷 / 07期
关键词：
D O I：
10.1145/358105.358191
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：695 / 702
页数：8
相关论文
共 50 条
  • [21] The saturation level in binary search tree
    Drmota, M
    MATHEMATICS AND COMPUTER SCIENCE: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2000, : 41 - 51
  • [22] The height of a random binary search tree
    Reed, B
    JOURNAL OF THE ACM, 2003, 50 (03) : 306 - 332
  • [23] ON FINDING THE HEIGHT OF A BINARY SEARCH TREE
    WEISS, MA
    COMPUTER JOURNAL, 1993, 36 (03): : 280 - 281
  • [24] A Practical Concurrent Binary Search Tree
    Bronson, Nathan G.
    Casper, Jared
    Chafi, Hassan
    Olukotun, Kunle
    PPOPP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2010, : 257 - 268
  • [25] A Practical Concurrent Binary Search Tree
    Bronson, Nathan G.
    Casper, Jared
    Chafi, Hassan
    Olukotun, Kunle
    ACM SIGPLAN NOTICES, 2010, 45 (05) : 257 - 268
  • [26] Note on searching in a binary search tree
    Andersson, Arne, 1991, (21)
  • [27] Efficient Tree Coding Algorithms
    Wang, Xiaodong
    Tian, Jun
    PRZEGLAD ELEKTROTECHNICZNY, 2012, 88 (7B): : 350 - 352
  • [28] EFFICIENT ALGORITHMS FOR TREE RECONSTRUCTION
    SLOUGH, W
    EFE, K
    BIT, 1989, 29 (02): : 361 - 363
  • [29] AND/OR-tree search algorithms in shogi mating search
    Sakuta, M
    Iida, H
    ICGA JOURNAL, 2001, 24 (04) : 231 - 235
  • [30] Performance comparison of binary search tree and framed ALOHA algorithms for RFID anti-collision
    Chen, Wen-Tzu
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2008, E91B (04) : 1168 - 1171
12345