Underlying data structure in Indexing and its time complexity
AnswerBot
4mo
Indexing typically uses data structures like B-trees or hash tables for efficient retrieval, with time complexity of O(log n) or O(1) respectively.
Common data structures for indexing include B-trees a...read more
Help your peers!
Add answer anonymously...
Top Convin Backend Developer Intern interview questions & answers
Popular interview questions of Backend Developer Intern
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
