CS 201 • Fundamental Structures of Computer Science I • Final

Definition of Recursion

An Example: Factorials

Another Example: Fibonacci Numbers

Some Background Information

What is a linkedlist?

Reminder: Structs

Constructing Linkedlists

Head and Tail Pointers

Printing a Linkedlist

Adding a Node to the End

Adding a Node in between Two Nodes (Add to a Sorted List)

Finding a Node in the List

Deleting a Node

Deleting the List

Example 1 (Parts a-c)

Example 1 (Parts d-e)

What is a Circular Linkedlist?

Constructing the List

Adding a Node to the Beginning/End

Adding a Node in between Two Nodes (Add to a Sorted List)

Counting Number of Elements

Finding a Node in the List

Deleting a Node

Example 1 (Parts a-c)

Example 1 (Parts d-e)

Constructing the List

Adding a Node to the Beginning

Adding a Node In Between two Nodes (Add to a Sorted List)

Adding a Node to End of the List

Deleting a Node from the Beginning

Deleting a Node in between Two Nodes (Deleting from a Sorted List)

Deleting a Node from the End

Finding a Node in the List

Example 1 (Parts a-c)

Example 1 (Parts d-e)

What is a Stack?

Stack Operations

Static Int Stack Implementation

Using StaticIntStack

Dynamic Int Stack

Dynamic Int Stack Implementation

Using DynIntStack

What is a Queue?

Queue Operations

Problem with dequeue

Static Int Queue Implementation

Using StaticIntQueue

Dynamic Int Queue

Dynamic Int Queue Implementation

Using DynIntQueue

Stack vs Queue

Linked Lists 1 - Part 1

Linked Lists 1 - Part 2

Linked Lists 2 - Part 1

Linked Lists 2 - Part 2

Linked Lists 3 - Part 1

Linked Lists 3 - Part 2

Linked Lists 4

Linked Lists 5 - Part 1

Linked Lists 5 - Part 1

Linked Lists 6

Stacks and Queues 1

Stacks and Queues 2

Stacks and Queues 3 - Part 1

Stacks and Queues 3 - Part 2

Stacks and Queues 4