A Fast Method For Accessing Nodes In The Binary Search Trees

İbrahim Ates; Mustafa Akpınar; Beyza Eken; Nejat Yumusak

EN

A Fast Method For Accessing Nodes In The Binary Search Trees

Abstract

In this study, a method that makes easy to process in the search trees is presented. A data structure which uses this method is also explained. It is explained how this method is used for strings. Performance comparisons with other trees like AVL, RB tree are showed. A hash table and a balanced binary search tree are used to implement this data structure. It is built the categorized subtrees according to data. Hash table is used to access data in the subtrees. It is aimed to process on relatively less amount of data collections instead of large amount of data collections. In this way the numbers of the process will be decreased. It will make positive affect on the program performance

Keywords

Balanced binary search tree, Hash table, AVL, RB Tree, Salkim Tree

Details

Primary Language

English

Subjects

-

Journal Section

-

Authors

İbrahim Ates This is me
Sakarya University, Department of Computer Engineering, Serdivan, Sakarya, Turkey

Mustafa Akpınar This is me
Sakarya University, Department of Computer Engineering, Serdivan, Sakarya, Turkey

Beyza Eken This is me
Sakarya University, Department of Computer Engineering, Serdivan, Sakarya, Turkey

Nejat Yumusak This is me
Sakarya University, Department of Computer Engineering, Serdivan, Sakarya, Turkey

Publication Date

July 23, 2016

Submission Date

July 23, 2016

Acceptance Date

-

Published in Issue

Year 2013 Volume: 3 Number: 2

IZ

https://izlik.org/JA23YD74WE

Cite

RIS / Bibtex

APA

Ates, İ., Akpınar, M., Eken, B., & Yumusak, N. (2016). A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT, 3(2), 1-8. https://izlik.org/JA23YD74WE

AMA

1.Ates İ, Akpınar M, Eken B, Yumusak N. A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT. 2016;3(2):1-8. https://izlik.org/JA23YD74WE

Chicago

Ates, İbrahim, Mustafa Akpınar, Beyza Eken, and Nejat Yumusak. 2016. “A Fast Method For Accessing Nodes In The Binary Search Trees”. TOJSAT 3 (2): 1-8. https://izlik.org/JA23YD74WE.

EndNote

Ates İ, Akpınar M, Eken B, Yumusak N (July 1, 2016) A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT 3 2 1–8.

IEEE

[1]İ. Ates, M. Akpınar, B. Eken, and N. Yumusak, “A Fast Method For Accessing Nodes In The Binary Search Trees”, TOJSAT, vol. 3, no. 2, pp. 1–8, July 2016, [Online]. Available: https://izlik.org/JA23YD74WE

ISNAD

Ates, İbrahim - Akpınar, Mustafa - Eken, Beyza - Yumusak, Nejat. “A Fast Method For Accessing Nodes In The Binary Search Trees”. TOJSAT 3/2 (July 1, 2016): 1-8. https://izlik.org/JA23YD74WE.

JAMA

1.Ates İ, Akpınar M, Eken B, Yumusak N. A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT. 2016;3:1–8.

MLA

Ates, İbrahim, et al. “A Fast Method For Accessing Nodes In The Binary Search Trees”. TOJSAT, vol. 3, no. 2, July 2016, pp. 1-8, https://izlik.org/JA23YD74WE.

Vancouver

1.İbrahim Ates, Mustafa Akpınar, Beyza Eken, Nejat Yumusak. A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT [Internet]. 2016 Jul. 1;3(2):1-8. Available from: https://izlik.org/JA23YD74WE