First page Back Continue Last page Overview Graphics
Summary
Selection of a data structure is problem dependent
Arrays and structures are built into most programming languages
Stacks are often used for temporary storage
Queues control access to a resource
Trees are efficient for retrieval
B-Trees can degenerate
AVL trees are balanced