Which of the following the BST is isometric with

Which of the following the BST is isometric with the 2-3 tree?
A. Splay tree
B. AA tree
C. Heap
D. Red – Black tree

Answer:
B. AA tree

Explanation:
AA tree is isometric of the 2-3 trees. In an AA tree, we store each node a level, which is the height of the corresponding 2-3 tree node. So, we can convert a 2-3 tree to an AA tree.


Which of the following data structure can provide efficient searching of the elements?
A. unordered lists
B. binary search tree
C. treap
D. 2-3 tree

Answer:
D. 2-3 tree

Explanation:
The average case time for lookup in a binary search tree, treap and 2-3 tree is O(log n) and in unordered lists it is O(n). But in the worst case, only the 2-3 trees perform lookup efficiently as it takes O(log n), while others take O(n).