Array, Linked List, and Binary Search Tree Comparison

In this paper, I present the comparison of necessary average programming steps for element search and deletion in basic data structures, like arrays, linked lists, and binary search trees. It is well known that an array is a very convenient data structure for accessing elements via indices, while it is complicated for element deletion, as it requires rearranging all the rest elements. Sorted arrays are very convenient for binary element search. On the other side linked list is a data structure that requires only a few steps for adding and deleting an element. I quantitatively confirm that the binary search tree is efficient both for binary search and for element deletion. This analysis may be used for the education of undergraduate and graduate students in computer science.

Ҳали таржима қилинмаган