Which concept is defined as follows: a tree-like data structure used to efficiently store and retrieve strings, especially for prefix matching?
- A. Trie ✓
- B. Heap
- C. Linked list
- D. AVL tree
Correct answer
A. Trie
Explanation
Trie refers to a tree-like data structure used to efficiently store and retrieve strings, especially for prefix matching.