Data Structures Using,3/ed.

Reema Thareja’s Data Structures Using C, 3rd Edition is a textbook for undergraduate and postgraduate computer science students. It covers fundamental concepts of data structures, their implementation in the C programming language, and various algorithms. The book is known for its clear explanations and straightforward approach to complex topics.
________________________________________
Key Topics
The book covers a wide range of topics, including:
• Arrays: One-dimensional and multi-dimensional arrays, as well as their operations.
• Linked Lists: Singly, doubly, and circular linked lists.
• Stacks and Queues: Both static (array-based) and dynamic (linked list-based) implementations.
• Trees: Binary trees, binary search trees (BSTs), and their traversals.
• Graphs: Graph representations, breadth-first search (BFS), and depth-first search (DFS).
• Sorting Algorithms: Bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
• Searching Algorithms: Linear search and binary search.
• Hashing: Hash functions and collision resolution techniques.
Target Audience
This book is primarily aimed at students learning data structures for the first time. It is used in colleges and universities as a core text for courses on data structures and algorithms. It’s also a valuable resource for software developers who want to refresh their knowledge of these foundational computer science topics.