1 Welcome to Data Structures
2 Complexity 1 Introduction to complexity
3 Complexity 2 Big Oh Notation
4 Complexity 3 Some examples of big-Oh notation
5 Java 1 ObjectOrientedProgramming
6 Java 2 ComparableGenerics
7 Java 3 Introduction to Generic Programming
8 Java 4 Parameterized Types
9 Java 5 Autoboxing
10 Java 6 Exceptions
11 LinkedList 1 Introduction
12 LinkedList 2 Nodes and Size
13 LinkedList 3 Boundary Conditions
14 LinkedList 4 addFirst()
15 LinkedList 5 addLast()
16 LinkedList 6 removeFirst()
17 LinkedList 7 removeLast()
18 LinkedList 8 remove and find
19 LinkedList 9 peek()
20 LinkedList 10 Testing the list
21 LinkedList 11 Iterators
22 LinkedList 12 Double Linked Lists
23 LinkedList 13 Circular Linked Lists
24 Stacks and Queues 3 Using arrays to write stacks and queues
25 Hashes 1 Introduction
26 Hashes 2 Hash Functions
27 Hashes 3 Collisions
28 Hashes 4 Hash Functions for Strings
29 Hashes 5 Compressing numbers to fit the size of the array
30 Hashes 6 Make an integer positive
31 Hashes 7 LoadFactor()
32 Hashes 8 Open Addressing
33 Hashes 9 Chaining
34 Hashes 10 Rehashing
35 Hashes 11 the hash class
36 Hashes 12 Review of the hash element inner class
37 Hashes 13 Constructor for a chained hash.
38 Hashes 14 Review of constructors
39 Hashes 15 add() and remove() methods
40 Hashes 16 getValue()
41 Hashes 17 resize
42 Hashes 18 KeyIterator
43 Trees and heaps 1 Introduction
44 Heaps 1 Introduction and Tree levels
45 Heaps 2 Add Remove
46 Heaps 3 TrickleUp
47 Heaps 4 TrickleDown
48 Heaps 5 HeapSort
49 Trees 2 Complete and Full
50 Trees 3 Traversal
51 Trees 4 Expression Trees
52 Trees 5 Node Class
53 Trees 6 recursive add
54 Trees 7 Contains
55 Trees 8 Remove
56 Trees 9 Introduction to rotations
57 Trees 10 Rotations
58 Trees 11 Coding Rotations
59 AVL 1 Introduction
60 AVL Tree 2 Nodes
61 AVL Tree 3 Adding a node
62 AVL Tree 4 recursive add for an AVL tree
63 AVL Tree 5 checking balance in an AVL tree
64 AVL Tree 6 Rebalancing AVL trees
65 AVL Tree 7 complete example of adding data to an AVL tree.
66 Red Black Tree 1 The Rules
67 Red Black Trees 2 Example of building a tree
68 Red Black Tree 3 - Classes
69 Red Black Tree 4 - Add methods
70 Red Black Tree 5 checking violations in the tree
71 Red Black Tree 6 The Rotate method
72 Red Black Tree 7 left rotate
73 Red Black Tree 8 leftRightRotate
74 Red Black Tree 9 height
75 Red Black Tree 10 number of black nodes
76 Sorts 1 Introduction to sorts
77 Sorts 2 Selection Sort
78 Sorts 3 Insertion Sort
79 Sorts 4 Insertion Sort Code
80 Sorts 5 Shell Sort
81 Sorts 6 Merge Sort
82 Sorts 7 Merge Sort Code
83 Sorts 8 Quick Sort
84 Sorts 9 Quick Sort Worst Case
85 Sorts 10 Quick Sort Code
86 Sorts 11 Radix Sort
87 Sorts 12 Sort Summary
88 Bloom Filters
89 k-mer algorithms: Compare and Swap