Abstract
Restricted universe data structures and their algorithms augment our knowledge of the behavior of standard data structures. Understanding the increase in asymptotic efficiency when restricting the universe of possible keys helps us to realize the limits of the common data structures, such as balanced binary trees. This paper first introduces the principles of restricted universe data structures and then empirically compares stratified trees and AVL trees in the connection with a simple algorithmic problem.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call