This book offers an introduction to data structures and their use in algorithm design. The focus is on the mathematical analysis of these structures, including their time and space complexity. Beginning with a discussion of necessary mathematical background, including exponentials and logarithms, the book then covers array-based lists, linked lists, skiplists, and trees. Each chapter includes code samples and exercises for student practice. The book concludes with a discussion of priority queues and hashing. This is an excellent resource for computer science students and practitioners looking to understand data structures and algorithm design.
