BibTex RIS Kaynak Göster

A Fast Method For Accessing Nodes In The Binary Search Trees

Yıl 2013, Cilt: 3 Sayı: 2, 1 - 8, 23.07.2016

İbrahim Ates Mustafa Akpınar Beyza Eken Nejat Yumusak

Öz

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

Anahtar Kelimeler

Balanced binary search tree Hash table AVL RB Tree Salkim Tree

Yıl 2013, Cilt: 3 Sayı: 2, 1 - 8, 23.07.2016

İbrahim Ates Mustafa Akpınar Beyza Eken Nejat Yumusak

Öz

Toplam 0 adet kaynakça vardır.

Ayrıntılar

Diğer ID JA56MJ76KS
Bölüm Makaleler
Yazarlar

İbrahim Ates Bu kişi benim

Mustafa Akpınar Bu kişi benim

Beyza Eken Bu kişi benim

Nejat Yumusak Bu kişi benim

Yayımlanma Tarihi 23 Temmuz 2016
Yayımlandığı Sayı Yıl 2013 Cilt: 3 Sayı: 2

Kaynak Göster

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.
AMA Ates İ, Akpınar M, Eken B, Yumusak N. A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT. Temmuz 2016;3(2):1-8.
Chicago Ates, İbrahim, Mustafa Akpınar, Beyza Eken, ve Nejat Yumusak. “A Fast Method For Accessing Nodes In The Binary Search Trees”. TOJSAT 3, sy. 2 (Temmuz 2016): 1-8.
EndNote Ates İ, Akpınar M, Eken B, Yumusak N (01 Temmuz 2016) A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT 3 2 1–8.
IEEE İ. Ates, M. Akpınar, B. Eken, ve N. Yumusak, “A Fast Method For Accessing Nodes In The Binary Search Trees”, TOJSAT, c. 3, sy. 2, ss. 1–8, 2016.
ISNAD Ates, İbrahim vd. “A Fast Method For Accessing Nodes In The Binary Search Trees”. TOJSAT 3/2 (Temmuz 2016), 1-8.
JAMA 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 vd. “A Fast Method For Accessing Nodes In The Binary Search Trees”. TOJSAT, c. 3, sy. 2, 2016, ss. 1-8.
Vancouver 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.