ANE - Árvore N-ária de Espalhamento Naturalmente Balanceada

Abstract

This work proposes a construction of a n-ary tree with criterion of searching based on an adaptative hashing function by level. In other words, a new data structure in hierarchical hashing way is developed, aiming to have simple implementation and efficient search of information identified for a primary key. Comparisons of performance between the proposed structure (ANE) and binary search tree (ABB and AVL), n-ary search tree (ANB e B), hash table using tree for collisions (EA), are implemented. The experimental validation of the natural balancing of ANE, in relation to height, is presented.