Toggle navigation
SI221 - Data Structures
Heaps
Options
Print
Class
1 - Introduction
2 - Software Development
3 - Scope & Lifetime
4 - Abstract Data Types
5 - Classes
6 - Constructors and Destructors
7 - Friend and Const and more Constructors
8 - Static Members and Nested Classes
9 - Stacks
10 - Recursion with Stacks
11 - Intro to Queues
12 - Implementing Queues
13 - Making a List ADT
14 - Intro to Templates
15 - Programming with Templates
16 - Function Objects
17 - The Standard Template Library
18 - Introduction to Trees
19 - Tree Traversals
20 - Priority Queues and Heaps
21 - Analysis of Algorithms I
22 - Analysis of Algorithms II
Lab
1 - Setup & Intro Lab
2 - Modular Programming
3 - Constructors and Member Functions
4 - Classes with Dynamic Memory
5 - Stacks
6 - Queues
7 - Linked Lists
8 - Templates
9 - The STL
10 - Trees
11 - Heaps
Project
1 - Project 1
2 - Project 2
3 - Project 3
Zero-Based Indexing
One-Based Indexing