The Ultimate Data Structures & Algorithms: Part 2

2189
0
2020-03-14 15:29:38
12
4
75
6
https://codewithmosh.com/
覆舟水是苍生泪, 不到横流君不知。
视频选集
(77/95)
1- Introduction
00:51
1- Introduction
00:56
2- What are Trees
05:37
4- Exercise- Building a Tree
02:42
5- Solution- insert()
07:45
6- Solution- find()
02:01
7- Traversing Trees
05:59
9- Recursion
05:40
10- Depth First Traversals
05:24
11- Depth and Height of Nodes
07:07
12- Minimum Value in a Tree
07:38
13- Exercise- Equality Checking
00:46
14- Solution- Equality Checking
04:09
15- Exercise- Validating Binary Search Trees
04:15
16- Solution- Validating Binary Search Trees
04:19
17- Exercise- Nodes at K Distance
01:49
18- Solution- Nodes at K Distance from the Root
04:38
19- Level Order Traversal
02:56
21- Summary
01:23
1- Introduction
00:32
2- Balanced and Unbalanced Trees
03:03
3- Rotations
05:03
4- AVL Trees
04:05
6- Exercise- Building an AVL Tree
01:12
7- Solution- insert()
08:49
8- Exercise- Height Calculation
01:25
9- Solution- Height Calculation
02:45
10- Exercise- Balance Factor
02:06
11- Solution- Balance Factor
04:03
12- Exercise- Detecting Rotations
02:55
13- Solution- Detecting Rotations
03:34
14- Exercise- Implementing Rotations
03:52
15- Solution- Implementing Rotations
05:41
17- Summary
01:02
1- Introduction
00:22
2- What are Heaps
06:29
4- Exercise- Building a Heap
01:56
5- Solution- insert()
08:25
6- Solution- remove()
07:08
7- Solution - Edge Cases
06:12
8- Heap Sort
02:30
9- Priority Queues
05:05
10- Exercise- Heapify
01:27
11- Solution- Heapify
07:13
12- Solution- Optimization
02:43
13- Exercise- Kth Largest Item
00:32
14- Solution- Kth Largest Item
03:48
16- Summary
01:21
1- Introduction
00:31
2- What are Tries
03:51
4- Exercise- Building a Trie
03:04
5- Solution- Building a Trie
05:45
6- An Implementation with a HashTable
01:51
7- A Better Abstraction
05:29
8- Exercise- Looking Up a Word
01:13
9- Solution- Looking Up a Word
02:36
10- Traversals
03:36
11- Exercise- Removing a Word
01:54
12- Solution- Removing a Word
08:15
13- Exercise- Auto Completion
02:53
14- Solution- Auto Completion
06:00
16- Summary
00:47
1- Introduction
00:27
2- What are Graphs
02:10
3- Adjacency Matrix
04:15
4- Adjacency List
06:33
5- Exercise- Building a Graph
01:52
6- Solution- Adding Nodes and Edges
07:35
7- Solution- Removing Nodes and Edges
04:49
8- Traversal Algorithms
03:59
10- Exercise- Depth-first Traversal (Recursive)
01:30
11- Solution- Depth-first Traversal (Recursive)
03:45
12- Exercise- Depth-first Traversal (Iterative)
02:45
13- Solution- Depth-first Traversal (Iterative)
04:00
14- Exercise- Breadth-first Traversal (Iterative)
01:20
15- Solution- Breadth-first Traversal
02:42
16- Exercise- Topological Sorting
05:07
17- Solution- Topological Sort
04:06
18- Exercise- Cycle Detection (Directed Graphs)
03:43
19- Solution- Cycle Detection (Directed Graphs)
06:28
20- Graphs Summary
01:03
1- Introduction
00:27
2- Exercise- Weighted Graphs
01:32
3- Solution- Weighted Graphs
05:21
4- An Object-oriented Solution
06:14
5- Dijkstra
04:36
6- Exercise- Getting the Shortest Distance
06:09
7- Solution- The Shortest Distance
05:28
8- Solution- Shortest Path
07:54
9- Exercise- Cycle Detection (Undirected Graphs)
02:04
10- Solution- Cycle Detection (Undirected Graphs)
04:43
11- Minimum Spanning Tree
01:57
12- Exercise- Prim
02:46
13- Solution- Prim
10:40
14- Course Wrap Up
00:31
客服
顶部
赛事库 课堂 2021拜年纪