Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
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 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
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).
