1.

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

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


Discussion

No Comment Found