Schaum's outline of theory and problems of data structures
By: Seymour Lipschutz.
Series: Schaum's outline series.
Publisher: McGraw-Hill
Published: 1986
Place of publication: New York
Language: eng
Number of pages: 344
Subjects: Data structures (Computer science)
Other titles: Data structures.; Theory and problems of data structures.
Notes: Includes index.
Table of contents: label: Chapter 1
title: Introduction and Overview
pagenum: 1; label: 1.1
title: Introduction
pagenum: 1; label: 1.2
title: Basic Terminology; Elementary Data Organization
pagenum: 1; label: 1.3
title: Data Structures
pagenum: 2; label: 1.4
title: Data Structure Operations
pagenum: 8; label: 1.5
title: Algorithms: Complexity, Time-Space Tradeoff
pagenum: 9; label: Chapter 2
title: Preliminaries
pagenum: 17; label: 2.1
title: Introduction
pagenum: 17; label: 2.2
title: Mathematical Notation and Functions
pagenum: 18; label: 2.3
title: Algorithmic Notation
pagenum: 21; label: 2.4
title: Control Structures
pagenum: 23; label: 2.5
title: Complexity of Algorithms
pagenum: 27; label: 2.6
title: Subalgorithms
pagenum: 30; label: 2.7
title: Variables, Data Types
pagenum: 31; label: Chapter 3
title: String Processing
pagenum: 41; label: 3.1
title: Introduction
pagenum: 41; label: 3.2
title: Basic Terminology
pagenum: 41; label: 3.3
title: Storing Strings
pagenum: 42; label: 3.4
title: Character Data Type
pagenum: 46; label: 3.5
title: String Operations
pagenum: 47; label: 3.6
title: Word Processing
pagenum: 49; label: 3.7
title: Pattern Matching Algorithms
pagenum: 53; label: Chapter 4
title: Arrays, Records and Pointers
pagenum: 67; label: 4.1
title: Introduction
pagenum: 67; label: 4.2
title: Linear Arrays
pagenum: 67; label: 4.3
title: Representation of Linear Arrays in Memory
pagenum: 69; label: 4.4
title: Traversing Linear Arrays
pagenum: 70; label: 4.5
title: Inserting and Deleting
pagenum: 71; label: 4.6
title: Sorting; Bubble Sort
pagenum: 73; label: 4.7
title: Searching; Linear Search
pagenum: 76; label: 4.8
title: Binary Search
pagenum: 78; label: 4.9
title: Multidimensional Arrays
pagenum: 81; label: 4.10
title: Pointers; Pointer Arrays
pagenum: 86; label: 4.11
title: Records; Record Structures
pagenum: 90; label: 4.12
title: Representation of Records in Memory; Parallel Arrays
pagenum: 92; label: 4.13
title: Matrices
pagenum: 94; label: 4.14
title: Sparse Matrices
pagenum: 97; label: Chapter 5
title: Linked Lists
pagenum: 114; label: 5.1
title: Introduction
pagenum: 114; label: 5.2
title: Linked Lists
pagenum: 115; label: 5.3
title: Representation of Linked Lists in Memory
pagenum: 116; label: 5.4
title: Traversing a Linked List
pagenum: 120; label: 5.5
title: Searching a Linked List
pagenum: 121; label: 5.6
title: Memory Allocation; Garbage Collection
pagenum: 123; label: 5.7
title: Insertion into a Linked List
pagenum: 127; label: 5.8
title: Deletion from a Linked List
pagenum: 134; label: 5.9
title: Header Linked Lists
pagenum: 140; label: 5.10
title: Two-Way Lists
pagenum: 144; label: Chapter 6
title: Stacks, Queues, Recursion
pagenum: 164; label: 6.1
title: Introduction
pagenum: 164; label: 6.2
title: Stacks
pagenum: 165; label: 6.3
title: Array Representation of Stacks
pagenum: 166; label: 6.4
title: Arithmetic Expressions; Polish Notation
pagenum: 168; label: 6.5
title: Quicksort, an Application of Stacks
pagenum: 173; label: 6.6
title: Recursion
pagenum: 176; label: 6.7
title: Towers of Hanoi
pagenum: 180; label: 6.8
title: Implementation of Recursive Procedures by Stacks
pagenum: 183; label: 6.9
title: Queues
pagenum: 188; label: 6.10
title: Deques
pagenum: 192; label: 6.11
title: Priority Queues
pagenum: 193; label: Chapter 7
title: Trees
pagenum: 214; label: 7.1
title: Introduction
pagenum: 214; label: 7.2
title: Binary Trees
pagenum: 214; label: 7.3
title: Representing Binary Trees in Memory
pagenum: 217; label: 7.4
title: Traversing Binary Trees
pagenum: 221; label: 7.5
title: Traversal Algorithms Using Stacks
pagenum: 224; label: 7.6
title: Header Nodes; Threads
pagenum: 229; label: 7.7
title: Binary Search Trees
pagenum: 233; label: 7.8
title: Searching and Inserting in Binary Search Trees
pagenum: 234; label: 7.9
title: Deleting in a Binary Search Tree
pagenum: 238; label: 7.10
title: Heap; Heapsort
pagenum: 243; label: 7.11
title: Path Lengths; Huffman's Algorithm
pagenum: 249; label: 7.12
title: General Trees
pagenum: 255; label: Chapter 8
title: Graphs and Their Applications
pagenum: 277; label: 8.1
title: Introduction
pagenum: 277; label: 8.2
title: Graph Theory Terminology
pagenum: 277; label: 8.3
title: Sequential Representation of Graphs; Adjacency Matrix; Path Matrix
pagenum: 280; label: 8.4
title: Warshall's Algorithm; Shortest Paths
pagenum: 282; label: 8.5
title: Linked Representation of a Graph
pagenum: 286; label: 8.6
title: Operations on Graphs
pagenum: 289; label: 8.7
title: Traversing a Graph
pagenum: 294; label: 8.8
title: Posets; Topological Sorting
pagenum: 297; label: Chapter 9
title: Sorting and Searching
pagenum: 318; label: 9.1
title: Introduction
pagenum: 318; label: 9.2
title: Sorting
pagenum: 318; label: 9.3
title: Insertion Sort
pagenum: 322; label: 9.4
title: Selection Sort
pagenum: 324; label: 9.5
title: Merging
pagenum: 325; label: 9.6
title: Merge-Sort
pagenum: 328; label: 9.7
title: Radix Sort
pagenum: 330; label: 9.8
title: Searching and Data Modification
pagenum: 332; label: 9.9
title: Hashing
pagenum: 333; title: Index
pagenum: 341