
Data Structures and Algorithms in C++
by Dima Kassab
Start the free chapterThis is an introductory course about algorithms and data structures. C++ is the programming language used in the course. The basics of this language will be reviewed before more difficult concepts are explored. VTC author and expert Dima Kassab will examine many topics, including: data design and implementation, primitive data structures (such as arrays and records), classes, templates, sorted and unsorted array-based lists, linked lists, doubly linked lists, stacks, queues, and binary search trees. To begin learning today, simply click on the movie links.
Course content
Introduction3 lessons
Installation4 lessons
C++ Language Basics9 lessons
Data Design and Implementation10 lessons
- Abstraction and Information Hiding3:271 credit or ad
- Program Design4:211 credit or ad
- Data Structures3:391 credit or ad
- Records4:591 credit or ad
- Arrays6:431 credit or ad
- Class Specification pt. 13:411 credit or ad
- Class Specification pt. 24:281 credit or ad
- Class Implementation6:091 credit or ad
- Class Objects4:531 credit or ad
- Object Parameters4:261 credit or ad
Lists12 lessons
- List Data Type3:381 credit or ad
- Unsorted List Specification pt. 13:421 credit or ad
- Unsorted List Specification pt. 23:571 credit or ad
- Unsorted List Implementation pt. 14:231 credit or ad
- Unsorted List Implementation pt. 26:011 credit or ad
- Unsorted List Implementation pt. 34:451 credit or ad
- Unsorted List Example4:191 credit or ad
- Sorted List Specification4:361 credit or ad
- Sorted List Implementation pt. 15:001 credit or ad
- Sorted List Implementation pt. 24:211 credit or ad
- Sorted List Implementation pt. 34:391 credit or ad
- Sorted List Example3:491 credit or ad
Linked Lists14 lessons
- Unsorted Linked List Specification6:231 credit or ad
- Unsorted Linked List Implementation pt. 13:111 credit or ad
- Unsorted Linked List Implementation pt. 23:171 credit or ad
- Unsorted Linked List Implementation pt. 35:221 credit or ad
- Unsorted Linked List Implementation pt. 46:161 credit or ad
- Unsorted Linked List Implementation pt. 53:001 credit or ad
- Unsorted Linked List Example3:551 credit or ad
- Sorted Linked List Implementation pt. 13:051 credit or ad
- Sorted Linked List Implementation pt. 26:131 credit or ad
- Sorted Linked List Example4:561 credit or ad
- Doubly Linked List Specification3:561 credit or ad
- Doubly Linked List Implementation pt. 14:281 credit or ad
- Doubly Linked List Implementation pt. 23:421 credit or ad
- Doubly Linked List Example3:581 credit or ad
Stacks and Queues15 lessons
- Stack Data Type3:381 credit or ad
- Array Based Stack Specification2:521 credit or ad
- Array Based Stack Implementation4:501 credit or ad
- Array Based Stack Example4:271 credit or ad
- Stack as a Linked Structure pt. 12:431 credit or ad
- Stack as a Linked Structure pt. 26:161 credit or ad
- Queue Data Type2:511 credit or ad
- Array Based Queue Specification3:461 credit or ad
- Array Based Queue Implementation pt. 15:291 credit or ad
- Array Based Queue Implementation pt. 26:231 credit or ad
- Array Based Queue Example6:251 credit or ad
- Queue as a Linked Structure pt. 13:341 credit or ad
- Queue as a Linked Structure pt. 25:141 credit or ad
- Templates pt. 14:011 credit or ad
- Templates pt. 25:041 credit or ad
Binary Search Trees19 lessons
- Binary Trees Structure4:421 credit or ad
- Binary Search Trees4:141 credit or ad
- Specification5:401 credit or ad
- Implementation: Constructor / Destructor4:121 credit or ad
- Implementation: MakeEmpty4:201 credit or ad
- Implementation: CountNodes4:531 credit or ad
- Implementation: RetrieveItem5:121 credit or ad
- Implementation: InsertItem5:401 credit or ad
- Implementation: DeleteItem pt. 14:221 credit or ad
- Implementation: DeleteItem pt. 25:591 credit or ad
- Implementation: GetPredecessor3:301 credit or ad
- Implementation: PrintTree3:011 credit or ad
- Implementation: ResetTree pt. 15:221 credit or ad
- Implementation: ResetTree pt. 22:551 credit or ad
- Implementation: PreOrder3:241 credit or ad
- Implementation: InOrder3:101 credit or ad
- Implementation: PostOrder4:391 credit or ad
- Implementation: GetNextItem5:151 credit or ad
- Example6:291 credit or ad