Comparison Based Analysis of Advanced Tree Structures

  • Monika *
DOI: https://doi.org/10.53555/cse.v1i3.1071
Keywords: Binary Search Tree, Self Balancing Tree, B-Tree, SplayTree, Scapegoat Tree, AA Tree,, AVL, Tree, B tree, Binary Heap

Abstract

In this paper, the comparison is done among the most commonly used tree data
structures i.e. B-trees and binary trees. This comparison is made among all the variants of these
trees on the basis of various operations done over them like creation, insertion, deletion, and
searching. The steps needed for these operations are counted and compared. This study can
help us to find out easily that which tree data structure can be used in an application to make it
efficient.

Downloads

Download data is not yet available.
Published
2015-03-31
How to Cite
*, M. (2015). Comparison Based Analysis of Advanced Tree Structures. IJRDO -Journal of Computer Science Engineering, 1(3), 70-78. https://doi.org/10.53555/cse.v1i3.1071
Issue
Vol. 1 No. 3 (2015): IJRDO - Journal of Computer Science Engineering
Section
Articles

Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.