✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
It will make positive affect on the program performance
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this study, a method that makes easy to process in the search trees is presented.
📊
Key Findings & Data:Performance comparisons with other trees like AVL, RB tree are showed.
💡
Conclusion & Impact:It will make positive affect on the program performance
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Balanced binary search tree · Hash table · AVL
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
🔖
Cite This Article
Ates, İ., Akpınar, M., Eken, B., YUMUSAK, N. (2016). A Fast Method For Accessing Nodes In The Binary Search Trees. TOJSAT, Cilt: 3 Sayı: 2, 1–8. https://ajindex.com/articles/1008625