CE 221 • Midterm • Data Structures and Algorithms

Motivation

Big-O Notation

Big-Omega Notation

Big-Theta Notation

Fundamental Rules

What is a Linked List?

Singular LinkedList

Doubly LinkedList

Circular LinkedList

What is a Stack?

Array Implementation

LinkedList Implementation

Introduction

Array Implementation

LinkedList Implementation

Tree as a Data Structure

Terminology

Binary Trees / Binary Search Trees

Example

Implementation

Example

Example

Why AVL Trees?

Height

Rotations - part 1

Rotations - part 2

Example 1

Example 2

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Algorithm Analysis

Stack/Queue

Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Trees / Binary Trees

Trees / Binary Trees

Trees / Binary Trees

AVL Trees

AVL Trees

AVL Trees