Keogh, James Edward,  1948- <br/><br/>
Data structures demystified / 
James Keogh & Ken Davidson. 
 - New York :  McGraw-Hill/Osborne,  2004. 
 - xviii, 277 p. :  ill. ;  23 cm. 
<br/><br/> Includes quizzes and answers.  Includes index. 
<br/><br/> Memory, abstract data types, and addresses  Point about variables and pointers  What is an array?  Stacks using an array  Queues using an array  What is a linked list?  Stacks using linked lists  Queues using linked lists  Stacks and queues: insert, delete, peek, find  What is a tree?  What is a hashtable? --  Chapter 1  Chapter 2 The  Chapter 3  Chapter 4  Chapter 5  Chapter 6  Chapter 7  Chapter 8  Chapter 9  Chapter 10  Chapter 11  Final exam --  Answers to quizzes and final exam --  Index 
<br/><br/> 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++. 
<br/><br/><label>ISBN: </label>0072253592 9780072253597 
<br/><br/><label>Standard No.: </label>783254043435 
<br/><br/><label>LCCN: </label>2004555590 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Data structures (Computer science)
<br/><br/><label>LC Class. No.: </label>QA76.9.D35  / K46 2004 
<br/><br/><label>Dewey Class. No.: </label>005.7/3