Home›Articles›Choosing between a hash table and a search treeArticleChoosing between a hash table and a search treeArticlesConnectionsSourcesComments (0)Reader Challenges (0)ConnectionsArticle OnAssociative array, Concepts Well-attested SourcesAssociative array (Wikipedia)Implementation: Tree implementationsQuote, Implementation: Tree implementationsBecause they are in order, tree-based maps can also satisfy range queries (find all values between two bounds) whereas a hashmap can only find exact values.View the SourceAtlas Article Vocabularytier 1AtlasComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.