Breadth First Search is used in
A. Binary trees
B. Stacks
C. Graphs
D. Both a and c above
Answer:C
Breadth First Search is used in
A. Binary trees B. Stacks C. Graphs D. Both a and c above
Explanation: Hashing is used to index and retrieve items in a database because it is easier to find the item using the shortened hashed key than using the original value. [/expand]