Урок 1.00:00:51
Introduction
Урок 2.00:00:56
Introduction
Урок 3.00:05:37
What are Trees
Урок 4.00:02:42
Exercise- Building a Tree
Урок 5.00:07:45
Solution- insert()
Урок 6.00:02:01
Solution- find()
Урок 7.00:05:59
Traversing Trees
Урок 8.00:05:40
Recursion
Урок 9.00:05:24
Depth First Traversals
Урок 10.00:07:07
Depth and Height of Nodes
Урок 11.00:07:38
Minimum Value in a Tree
Урок 12.00:00:46
Exercise- Equality Checking
Урок 13.00:04:09
Solution- Equality Checking
Урок 14.00:04:15
Exercise- Validating Binary Search Trees
Урок 15.00:04:19
Solution- Validating Binary Search Trees
Урок 16.00:01:49
Exercise- Nodes at K Distance
Урок 17.00:04:38
Solution- Nodes at K Distance from the Root
Урок 18.00:02:56
Level Order Traversal
Урок 19.00:01:23
Summary
Урок 20.00:00:32
Introduction
Урок 21.00:03:02
Balanced and Unbalanced Trees
Урок 22.00:05:03
Rotations
Урок 23.00:04:05
AVL Trees
Урок 24.00:01:12
Exercise- Building an AVL Tree
Урок 25.00:08:48
Solution- insert()
Урок 26.00:01:25
Exercise- Height Calculation
Урок 27.00:02:44
Solution- Height Calculation
Урок 28.00:02:05
Exercise- Balance Factor
Урок 29.00:04:02
Solution- Balance Factor
Урок 30.00:02:55
Exercise- Detecting Rotations
Урок 31.00:03:34
Solution- Detecting Rotations
Урок 32.00:03:52
Exercise- Implementing Rotations
Урок 33.00:05:41
Solution- Implementing Rotations
Урок 34.00:01:02
Summary
Урок 35.00:00:22
Introduction
Урок 36.00:06:29
What are Heaps
Урок 37.00:01:56
Exercise- Building a Heap
Урок 38.00:08:25
Solution- insert()
Урок 39.00:07:08
Solution- remove()
Урок 40.00:06:12
Solution - Edge Cases
Урок 41.00:02:30
Heap Sort
Урок 42.00:05:05
Priority Queues
Урок 43.00:01:27
Exercise- Heapify
Урок 44.00:07:13
Solution- Heapify
Урок 45.00:02:43
Solution- Optimization
Урок 46.00:00:32
Exercise- Kth Largest Item
Урок 47.00:03:48
Solution- Kth Largest Item
Урок 48.00:01:20
Summary
Урок 49.00:00:31
Introduction
Урок 50.00:03:51
What are Tries
Урок 51.00:03:04
What are Tries
Урок 52.00:05:45
Solution- Building a Trie
Урок 53.00:01:51
An Implementation with a HashTable
Урок 54.00:05:29
A Better Abstraction
Урок 55.00:01:13
Exercise- Looking Up a Word
Урок 56.00:02:36
Solution- Looking Up a Word
Урок 57.00:03:36
Traversals
Урок 58.00:01:54
Exercise- Removing a Word
Урок 59.00:08:15
Solution- Removing a Word
Урок 60.00:02:52
Exercise- Auto Completion
Урок 61.00:06:00
Solution- Auto Completion
Урок 62.00:00:46
Summary
Урок 63.00:00:27
Introduction
Урок 64.00:02:10
What are Graphs
Урок 65.00:04:15
Adjacency Matrix
Урок 66.00:06:33
Adjacency List
Урок 67.00:01:51
Exercise- Building a Graph
Урок 68.00:07:35
Solution- Adding Nodes and Edges
Урок 69.00:04:49
Solution- Removing Nodes and Edges
Урок 70.00:03:59
Traversal Algorithms
Урок 71.00:01:30
Exercise- Depth-first Traversal (Recursive)
Урок 72.00:03:45
Solution- Depth-first Traversal (Recursive)
Урок 73.00:02:45
Exercise- Depth-first Traversal (Iterative)
Урок 74.00:04:00
Solution- Depth-first Traversal (Iterative)
Урок 75.00:01:19
Exercise- Breadth-first Traversal (Iterative)
Урок 76.00:02:42
Solution- Breadth-first Traversal
Урок 77.00:05:07
Exercise- Topological Sorting
Урок 78.00:04:06
Solution- Topological Sort
Урок 79.00:03:43
Exercise- Cycle Detection (Directed Graphs)
Урок 80.00:06:27
Solution- Cycle Detection (Directed Graphs)
Урок 81.00:01:03
Graphs Summary
Урок 82.00:00:27
Introduction
Урок 83.00:01:31
Exercise- Weighted Graphs
Урок 84.00:05:21
Solution- Weighted Graphs
Урок 85.00:06:14
An Object-oriented Solution
Урок 86.00:04:36
Dijkstra's Shortest Path Algorithm
Урок 87.00:06:09
Exercise- Getting the Shortest Distance
Урок 88.00:05:28
Solution- The Shortest Distance
Урок 89.00:07:54
Solution- Shortest Path
Урок 90.00:02:04
Exercise- Cycle Detection (Undirected Graphs)
Урок 91.00:04:43
Solution- Cycle Detection (Undirected Graphs)
Урок 92.00:01:57
Minimum Spanning Tree
Урок 93.00:02:46
Exercise- Prim's Algorithm
Урок 94.00:10:40
Solution- Prim's Algorithm
