Visualizing Data Structures Front Cover

Visualizing Data Structures

  • Length: 361 pages
  • Edition: 1
  • Publisher:
  • Publication Date: 2015-09-02
  • ISBN-10: B015D3X3ZC
  • Sales Rank: #843709 (See Top 100 Books)

This book is intended for an introductory data structures class, either as a supplement to a traditional textbook or as a stand-alone resource. The intended audience is second-semester computer science students with knowledge of programming in C or C++. The focus is on fundamental concepts of data structures and algorithms and providing the necessary detail for students to implement the data structures presented. Basic data structures, including arrays, stacks, queues, linked lists, trees, binary search trees, tree balancing, hash tables, and graphs are presented, including the operations on those data structures. The algorithms are presented in a language that could be called “pseudocode with C++ tendencies.” In many cases, basic C++ is also provided. Sorting algorithms and an introduction to complexity analysis and Big-Oh notation are also included. Each chapter includes numerous pictures depicting the data structures and how the basic operations on the structures modify their contents.

Table of Contents

Chapter 1 Algorithms
Chapter 2 Computer memory
Chapter 3 Arrays
Chapter 4 Sorting algorithms
Chapter 5 Linked lists
Chapter 6 Stacks
Chapter 7 Queues
Chapter 8 Binary Trees
Chapter 9 Binary Search Trees
Chapter 10 Recursion
Chapter 11 Tree Balancing
Chapter 12 Graphs
Chapter 13 Hash tables

To access the link, solve the captcha.