Computer Science · Data Structures
A trie (prefix tree) is implemented for autocomplete suggestions in a search bar for regulatory filings, where each node represents a character and edges branch for possible continuations. Inserting a word of length m like 'SEBI' creates paths for S-E-B-I. What is the average time complexity for prefix-based lookups, independent of the total dictionary size?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(1)
- 2O(m log n)
- 3O(n) where n is total words
- 4O(m)✓
Correct answer
O(m)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures