Data Structures · ContentsStudy companionData Structures
Using C

Search concepts across the book

C11 core · C++17 appendix
Offline reading · no account required
Progress stays in this browser.

CSE-201F · Four-section learning route

Data Structures
Using C

Study how data is organised, trace how algorithms work, and test the implementation. An introductory study edition, with a connected route from arrays and linked lists to trees, graphs and file handling.

14 core chapters10 C laboratoriesWorked tracesSeparate practice answers
Start reading →Plan your studyPrint-friendly book
01Understand the rule
02Trace the operation
03Run the program
04Check the invariant
How to use the book. Work through each trace on paper before running the lab. Keep capacity, logical size and memory ownership explicit. Use the answer section only after attempting the questions.

Section A

Build the foundations, then work with contiguous storage and linear ADTs.

Chapter 01

C foundations for data structures

Types, ADTs, contracts and control flow.

Chapter 02

Algorithms and complexity

Invariants, growth rates and workload choices.

Chapter 03

Arrays and address calculation

Logical length, shifting and row-major storage.

Chapter 04

Searching techniques

Linear search, binary search and boundary reasoning.

Chapter 05

Sorting techniques

Six methods, stability, costs and worked passes.

Chapter 06

Stacks and queues using arrays

LIFO, FIFO, expression evaluation and ring buffers.

Section B

Move from indices to links and take responsibility for memory.

Chapter 07

Pointers and dynamic memory

Pointer validity, allocation, ownership and lifetime.

Chapter 08

Linked lists

Insertion, deletion, reversal and list variants.

Chapter 09

Linked stacks and queues

Head and tail invariants through empty transitions.

Section C

Represent branching relationships and explore connected data.

Chapter 10

Trees and binary search trees

Representation, traversal orders and BST operations.

Chapter 11

Threaded trees and B-trees

Thread links, multiway search and B-tree splits.

Chapter 12

Graphs and traversal

Representations, BFS, DFS, shortest paths and MSTs.

Section D

Persist records and maintain efficient search structures.

Chapter 13

File handling in C

Streams, checked I/O, records and portability.

Chapter 14

AVL trees, sets and skip lists

Rotations, set operations and probabilistic search.

Enrichment

Extend the core without mixing language or syllabus boundaries.

Appendix A

Hashing

Collision handling, probing and tombstone deletion.

Appendix B

C++ comparison

A clearly separated C++17 inversion-counting example.

Core examples use C11. The C++17 example is kept in its own appendix. Open any chapter directly or use the topic search; all core content and diagrams are available offline.