Question
Which data structure or concept is best described as a compressed trie that merges chains of single-child nodes?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Radix Tree
Explanation:
Radix Tree is a compressed trie that merges chains of single-child nodes.
This description distinguishes it from the other choices.
Leave a Reply