Abstract
We propose an extended AVL tree with 5-subtrees, for the purpose of increasing search efficiency. In this paper, we report the results of our numerical experiment and examine the efficiency of our extended tree. The data structure of this extended AVL tree contains 5 partially balanced subtrees that match prefixes character by character by implementing the radix search method. Within the results of our numerical experiment, it was revealed that our tree's data structure capability is 55%-70% faster than that of conventional AVL trees.
