TY  - BOOK
AU  - Keogh,James Edward
AU  - Davidson,Ken
TI  - Data structures demystified
SN  - 0072253592
AV  - QA76.9.D35 K46 2004
U1  - 005.7/3 22
PY  - 2004///
CY  - New York
PB  - McGraw-Hill/Osborne
KW  - Data structures (Computer science)
N1  - Includes quizzes and answers; Includes index; Chapter 1; Memory, abstract data types, and addresses; Chapter 2 The; Point about variables and pointers; Chapter 3; What is an array?; Chapter 4; Stacks using an array; Chapter 5; Queues using an array; Chapter 6; What is a linked list?; Chapter 7; Stacks using linked lists; Chapter 8; Queues using linked lists; Chapter 9; Stacks and queues: insert, delete, peek, find; Chapter 10; What is a tree?; Chapter 11; What is a hashtable? --; Final exam --; Answers to quizzes and final exam --; Index
N2  - If you've been searching for that quick, easy to understand quide to walk you through data structures, look no further. Whether you're trying to program stacks and linked lists or figure out hashtables, here you'll find step by step instructions to get the job done fast. Each chapter starts off with an example from everyday life to demonstrate upcoming concepts. The authors go a step further and offer examples at the end of the chapter illustrating what you've just learned in Java and C++
UR  - http://catdir.loc.gov/catdir/enhancements/fy0621/2004555590-b.html
UR  - http://catdir.loc.gov/catdir/enhancements/fy0621/2004555590-d.html
UR  - http://catdir.loc.gov/catdir/enhancements/fy0621/2004555590-t.html
ER  -