This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Data Stuctures Stacks (abstract data type) Queues (abstract data type) Binary Trees AVL Trees Heeps Hssh Tables Stacks Modify: push (place item on top), pop(remove top item) Functions: full?, empty?, top (look at top of stack)...
View Full Document
This note was uploaded on 11/09/2009 for the course COP 3223 taught by Professor Guha during the Spring '08 term at University of Central Florida.
- Spring '08