Which of the following is the application of the Trie?
(A)
Integer arithmetic operations.
(B)
Pattern Searching
(C)
Sorting and merging large datasets.
(D)
Implementation of Heap
Answer: (B)
Explanation:
Trie data structure is defined as a Tree based data structure that is used for storing some collection of strings and performing efficient search operations on them. The word Trie is derived from reTRIEval, which means finding something or obtaining it.
Trie follows some property that If two strings have a common prefix then they will have the same ancestor in the trie. A trie can be used to sort a collection of strings alphabetically as well as search whether a string with a given prefix is present in the trie or not.
We can efficiently do prefix search (or auto-complete) with Trie.
Hence Option(B) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post