B4.1 Fundamentals of ADTs

This section introduces the fundamentals of Abstract Data Types (ADTs), which are essential for structuring complex data in a way that supports efficient operations and clear interface boundaries. Students will explore the properties, purpose, and core principles of ADTs, and evaluate key structures such as linked lists—singly, doubly, and circular—as well as binary search trees (BSTs) and sets. Through analysis and implementation, they will gain a deep understanding of how these ADTs are used to organize data, optimize performance, and support problem-solving in high-level programming.