A Fast Method For Accessing Nodes In The Binary Search Trees

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

Makale detayları

A Fast Method For Accessing Nodes In The Binary Search Trees

Yazarlar:

İbrahim Ates | Mustafa Akpınar | Beyza Eken | Nejat YUMUSAK

Yayıncı:

The association of science, education and technology

Dergi:

TOJSAT 2013 Vol.3 Issue 2, pp.1-8

Belge Tipi:

Makale

Yayın Tarihi:

7/2016

Belge Dili:

Türkçe

Document ID (Org No.):

2000835969

Sıklık:

Üç Aylık

pISSN:

2146-7390

Özet:

 

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.

Makale detayları

A Fast Method For Accessing Nodes In The Binary Search Trees

Yazarlar: İbrahim Ates | Mustafa Akpınar | Beyza Eken | Nejat YUMUSAK

Yayıncı: The association of science, education and technology

Dergi: TOJSAT 2013 Vol.3 Issue 2, pp.1-8

Belge Tipi: Makale

Yayın Tarihi: 7/2016

Belge Dili: Türkçe

Document ID (Org No.): 2000835969

Sıklık: Üç Aylık

pISSN: 2146-7390

Sayı

Yazarlar:

İbrahim Ates | Mustafa Akpınar | Beyza Eken | Nejat YUMUSAK

Yayıncı:

The association of science, education and technology

Dergi:

TOJSAT 2013 Vol.3 Issue 2, pp.1-8

Belge Tipi:

Makale

Yayın Tarihi:

7/2016

Belge Dili:

Türkçe

Document ID (Org No.):

2000835969

Sıklık:

Üç Aylık

pISSN:

2146-7390