Binary search tree is an example of:
A. Divide and conquer technique
B. Greedy algorithm
C. Back tracking
D. Dynamic Programming
Answer:A
Binary search tree is an example of:
A. Divide and conquer technique B. Greedy algorithm C. Back tracking D. Dynamic Programming