Kakkot Tree- A Binary Search Tree with Caching

被引：0
|
作者：
Ramachandran, Rajesh [1 ]
机构：
[1] Sree Narayana Gurukulam Coll Engn, Dept MCA, Ernakulam, India
来源：
2012 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC) | 2012年
关键词：
Searching; Binary Search Tree; Data Structure; Caching; Kakkot Tree;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Kakkot Tree is a Binary Searching Tree with the caching concept added. It is used to speed up the searching process that is carried on a Binary Search Tree. The time complexity of BST varies between O(n) and O(log n) depends upon the number of nodes that are present in left and right children. Kakkot Tree is a new data structure which is a variant of BST with some initial nodes which act like caching.
引用
收藏
页码：229 / 234
页数：6
相关论文
共 50 条
  • [1] TREE- AND CROWN FORMS
    Nowak, Rudolf
    [J]. MITTEILUNGEN KLOSTERNEUBURG, 2012, 62 (02): : 104 - 109
  • [2] Oscillations in the Height of the Yule Tree and Application to the Binary Search Tree
    Corre, Pierre-Antoine
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (01) : 90 - 120
  • [3] Binary Search Tree Visualization Algorithm
    Borovskiy, Vadym
    Mueller, Jueller
    Schapranow, Matthieu-Patrick
    Zeier, Alexander
    [J]. 2009 IEEE 16TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2009, : 1953 - 1957
  • [4] The saturation level in binary search tree
    Drmota, M
    [J]. MATHEMATICS AND COMPUTER SCIENCE: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2000, : 41 - 51
  • [5] A NOTE ON SEARCHING IN A BINARY SEARCH TREE
    ANDERSSON, A
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (10): : 1125 - 1128
  • [6] The height of a random binary search tree
    Reed, B
    [J]. JOURNAL OF THE ACM, 2003, 50 (03) : 306 - 332
  • [7] A Practical Concurrent Binary Search Tree
    Bronson, Nathan G.
    Casper, Jared
    Chafi, Hassan
    Olukotun, Kunle
    [J]. PPOPP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2010, : 257 - 268
  • [8] ON FINDING THE HEIGHT OF A BINARY SEARCH TREE
    WEISS, MA
    [J]. COMPUTER JOURNAL, 1993, 36 (03): : 280 - 281
  • [9] Note on searching in a binary search tree
    [J]. Andersson, Arne, 1991, (21)
  • [10] A Practical Concurrent Binary Search Tree
    Bronson, Nathan G.
    Casper, Jared
    Chafi, Hassan
    Olukotun, Kunle
    [J]. ACM SIGPLAN NOTICES, 2010, 45 (05) : 257 - 268
12345