Kakkot Tree — A Binary Search Tree with caching

Abstract

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.

6 Figures and Tables

Cite this paper

@article{Ramachandran2012KakkotT, title={Kakkot Tree — A Binary Search Tree with caching}, author={Rajesh Ramachandran}, journal={2012 IEEE International Conference on Computational Intelligence and Computing Research}, year={2012}, pages={1-6} }