Review for the Final Exam
•
When implementing a table abstract data type,
explain why you would select:
–
a) hash table
–
b) binary search tree
–
c) red-black tree
–
d) 2-3 tree
–
e) graph
–
f) linear linked list
–
g) 2-3-4 tree
–
h) doubly linked list
