+1 vote
in Data Structures & Algorithms I by (110k points)
Associative arrays can be implemented using __________

(a) B-tree

(b) A doubly linked list

(c) A single linked list

(d) A self balancing binary search tree

The query is from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

I had been asked this question in final exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (d) A self balancing binary search tree

Easiest explanation - Associative arrays can be implemented using a self balancing binary search tree as the worst-case time performance of self – balancing binary search trees is O(log n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...