A brief outline of the book is as follows :
Chapter 1 covers introduction to data structures, their types, possible operations on data structures
and concept of abstract data type.
Chapter 2 deals with data structures Stack and Queue, operations on them, array implementation of
stack and queue and their various applications.
Chapter 3 introduces the data structure Linked list. It covers types of linked lists, operations on
linked list and applications.
Chapter 4 focuses on data structure Trees, Binary Trees, Tree traversal techniques, Binary Search
Tree, AVL Tree, B- Tree, B+ Tree and their implementations with different operations.
Chapter 5 introduces the data structure Graphs. It covers different implementations of graphs and
different algorithms related to graph data structure.
Chapter 6 describes various searching, hashing techniques and covers different collision resolution
For better understanding, examples related to the concepts are solved inside chapters. The review
exercise given at the end of chapters consists of MCQs for self-assessment and descriptive questions
along with questions asked in University Papers.
Chapter 1 : Introduction to Data Structures,
Chapter 2 : Stack and Queues,
Chapter 3 : Linked List,
Chapter 4 : Trees,
Chapter 5 : Graphs,
Chapter 6 : Searching Techniques.