The book has been divided into six chapters. Chapter 1 deals with the preliminaries that are required to appreciate the need for studying data structures. Chapter 2 presents the linear class of data structures. Chapter 3 deals with the important non-linear structures. Advanced data structures such as balanced search trees, heaps etc. have been explained in detail in Chapter 4. Meticulous effort has been taken to provide algorithms for each operation to be performed on these data structures, which could be readily converted into working programs using any one of the modern programming languages.