Data Structures

Learn Data Structures the easy way, with simple explanations, clear diagrams and working C programs.

This beginner-friendly edition explains every important topic with an everyday picture: a pile of plates for a stack, the canteen line for a queue, a treasure hunt for a linked list and school lockers for an array. Each section starts with a short "In Simple Words" box, and every algorithm is shown step by step.

What you will find inside:
• Introduction to data structures, abstract data types, algorithms and Big O analysis
• Arrays, sparse matrices, stacks, queues (circular, priority and double-ended) and recursion
• Singly, doubly and circular linked lists, and polynomial addition
• Trees, binary search trees, AVL trees, heaps, graphs, BFS, DFS, spanning trees, shortest paths, Huffman coding and B-trees
• Sorting (bubble, selection, insertion, merge, quick, heap, shell, counting, radix), searching and hashing
• 39 diagrams, 23 complete C programs with their outputs, tables, key points and exercises
• "What You Will Learn" boxes and "Quick Check" questions with answers in every chapter
• A special appendix with 56 company interview and placement exam questions with answers
• A glossary of the main terms

All programs were compiled with GCC and their printed outputs were checked.

Who is this book for?
Students of BCA, MCA, B.Tech, diploma and school-level computer science, self-learners, and anyone preparing for campus placements and technical interviews. Basic knowledge of C is helpful.

About the author:
Pramod Kumar Saket teaches at Lakshmi Narain College of Technology (MCA), Bhopal, India.