A beginner of the Data structures, who has some basic knowledge of C, could find this book interesting and simple. Every program has a proper step by step explanation of each line of code. It contains the practical implementation of stacks, queues, linked lists, trees, graphs, searching and sorting techniques. Also, recursion has been explained in an easy manner with the numerous examples. However if you find any mistake, or want to give some suggestions for the improvement of this book, then the same may be sent at 'sachdevayogish@yahoo.co.in', so that the mistakes may be rectified and the suggestions may be incorporated.
Topics, which are covered in this book, are:

1. INTRODUCTION TO DATA STRUCTURES
1.1 ARRAYS
1.2 STACKS
1.3 QUEUES
1.4 LINKED LISTS
1.5 TREES
1.6 GRAPHS
1.7 DATA STRUCTURE OPERATIONS
2. STACKS
2.1 POLISH NOTATION
2.2 TRANSFORMING AN INFIX EXPRESSION INTO A POSTFIX EXPRESSION
2.3 EVALUATION OF A POSTFIX EXPRESSION
3. QUEUES
3.1 CIRCULAR QUEUE
3.2 PRIORITY QUEUES
3.3 DEQUES
3.4 INPUT RESTRICTED DEQUE
3.5 OUTPUT RESTRICTED DEQUE
4. RECURSION
4.1 BACKTRACKING
4.2 FACTORIAL OF A NUMBER
4.3 MULTIPLYING TWO NUMBERS USING RECURSION
4.4 GREATEST COMMON DIVISOR
4.5 FIBONACCI SERIES
4.6 BINARY SEARCH USING RECURSION
4.7 TOWERS OF HANOI
4.8 8 QUEENS PROBLEM
4.9 GENERATING PERMUTATIONS
4.10 TO FIND OUT THE DETERMINANT OF A MATRIX
4.11 INVERSE OF A MATRIX
4.12 A RECURSIVE PROBLEM
5. LINKED LISTS
5.1 LINEAR LINKED LIST
5.2 CIRCULAR LINKED LIST
5.3 DOUBLY LINKED LIST
6. STACKS AND QUEUES USING LINKED LISTS
6.1 STACKS USING LINKED-LIST
6.2 QUEUE USING LINKED-LIST
6.3 PRIORITY QUEUE USING LINKED-LIST
7. TREES
7.1 BINARY TREES
7.2 COMPLETE BINARY TREES
7.3 DEPTH (OR HEIGHT) OF A TREE
7.4 BINARY SEARCH TREES
7.5 TRAVERSING IN TREES WITHOUT USING RECURSION
7.6 HEIGHT BALANCED TREES; AVL TREES
7.7 THREADED BINARY TREES; INORDER THREADING
8. GRAPHS
8.1 SIMPLE GRAPH
8.2 DIGRAPH (DIRECTED GRAPH)
8.3 SIMPLE DIRECTED GRAPH
8.4 WEIGHTED GRAPH
8.5 PATH
8.6 CYCLE
8.7 CONNECTED GRAPH
8.8 COMPLETE GRAPH
8.9 INCIDENCE AND DEGREE
8.10 NULL GRAPH
8.11 ADJACENCY MATRIX
8.12 PATH MATRIX
8.13 WARSHALL’S ALGORITHM
8.14 SHORTEST PATH ALGORITHM
8.15 GRAPH COLORING
8.16 HAMILTONIAN CYCLES
8.17 ADJACENCY LIST
8.18 GRAPH TRAVERSAL
8.19 MINIMUM COST SPANNING TREES
8.20 TOPOLOGICAL SORT
9. SEARCHING
9.1 SEQUENTIAL SEARCH
9.2 BINARY SEARCH
10. SORTING
10.1 BUBBLE SORT
10.2 SELECTION SORT
10.3 INSERTION SORT
10.4 SHELL SORT
10.5 MERGING OF TWO SORTED ARRAYS
10.6 MERGE SORT
10.7 MERGE SORT USING RECURSION
10.8 QUICKSORT
10.9 RADIX SORT
10.10 HEAP SORT
10.11 BINARY TREE SORT
10.12 ADDRESS CALCULATION SORT