Computer Science · Data Structures

कोलिजन समाशोधन (collision resolution) के लिए बाइनरी सर्च ट्री का उपयोग करने वाली हैश टेबल में सर्च फ़ंक्शन की समय जटिलता (time complexity) क्या होती है?

Verified Solution4 OptionsUpdated: October 2026👁️1 View

1O(n log n)
2O(log n)✓
3O(n)
4O(1)

सही उत्तर देखें

O(log n)

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

Preparing for Computer Science?

Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.

Attempt Data Structures MCQs →All Mock Tests

Chapter Practice

Want more practice questions on Data Structures?

Solve complete topic-wise tests with detailed solutions on GkGet.

Practice Data Structures MCQs →

Recommended practice questions in Computer Science · Data Structures

Browse More Computer Science →

What is the worst-case time complexity of inserting 'n' elements into an initially empty linked list such that the linked list remains sorted?

Solve Question→

What are the contents of an initially empty stack (from bottom to top) after performing the following operations? PUSH(A); PUSH(B); PUSH(C); POP; PUSH(D); POP; POP; PUSH(E); PUSH(F); POP;

Solve Question→

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions