Professor Kevin Wortman - VideoAndMovie

Set Abstract Data Type

4:49

Set Abstract Data Type

BSTs versus Hash Tables

6:29

BSTs versus Hash Tables

Chained Hash Table: Analysis

7:53

Chained Hash Table: Analysis

Chained Hash Table: Structure and Operations

9:28

Chained Hash Table: Structure and Operations

Multiplicative Hashing

10:18

Multiplicative Hashing

Expected Time Efficiency

14:04

Expected Time Efficiency

Hash Functions

13:15

Hash Functions

Hash Tables Overview

11:29

Hash Tables Overview

AVL Tree Analysis

10:18

AVL Tree Analysis

AVL Tree Trinode Restructuring

15:28

AVL Tree Trinode Restructuring

AVL Tree Overview

9:40

AVL Tree Overview

Balanced BSTs

7:54

Balanced BSTs

BST Analysis

10:32

BST Analysis

BST Removal Code

12:16

BST Removal Code

Iterative BST Search

7:24

Iterative BST Search

BST Removal Algorithm

15:26

BST Removal Algorithm

BST Node Removal

13:31

BST Node Removal

BST Insertion Code

6:51

BST Insertion Code

BST Insertion Algorithm

11:50

BST Insertion Algorithm

Recursive Binary Tree Traversal

9:59

Recursive Binary Tree Traversal

Recursive BST Search

11:04

Recursive BST Search

Linear Recursion in BSTs

6:20

Linear Recursion in BSTs

BST Search Algorithm

10:15

BST Search Algorithm

Binary Search Tree Class

8:22

Binary Search Tree Class

Binary Search Trees (BSTs)

9:39

Binary Search Trees (BSTs)

Binary Tree Traversal Algorithms

7:04

Binary Tree Traversal Algorithms

Binary Tree Height Bounds

8:25

Binary Tree Height Bounds

Binary Trees

11:06

Binary Trees

Map Abstract Data Type

10:53

Map Abstract Data Type

Graph Traversal Analysis

10:46

Graph Traversal Analysis