Introduction
jThis book includedes a concise presentation of data structures such as AVL Trees, m-way search trees and B trees supplemented with solved problems and programming problems. A brief discussion on other notations of algorithm complexity, apart from O notation, has also been included. To demonstrate the implementation of data structures in a specific programming language, an appendix illustrating the implementation of a selective set of algorithms and procedures from the main text in the programming language C, has been added.
Key features
Table of contents
Chapter 1. Introduction and Overview
Chapter 2. Preliminaries
Chapter 3. String Processing
Chapter 4. Arrays, Records and Pointers
Chapter 5. Linked Lists
Chapter 6. Stacks, Queues, Recursion
Chapter 7. Trees
Chapter 8. Graphs and Their Applications
Chapter 9. Sorting and Searching
