Vidyalelo
Data Structure · Q59

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 59

Q59

A program to search a contact from phone directory can be implemented efficiently using . . . . . . . .

A.
a BST
B.
a trie
Answer
C.
a balanced BST
D.
a binary tree

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board