CodeWithMosh - Data Structures and Algorithms Part 2 AhLaN

1. 7. Undirected Graphs/13- Solution- Prim_s Algorithm~.mp4412.32MB
2. 1. Getting Started/1- Introduction~.mp450.23MB
3. 2. Binary Trees/1- Introduction~.mp447.13MB
4. 2. Binary Trees/2- What are Trees~.mp465.03MB
5. 2. Binary Trees/4- Exercise- Building a Tree~.mp435.95MB
6. 2. Binary Trees/5- Solution- insert()~.mp4172.73MB
7. 2. Binary Trees/6- Solution- find()~.mp436.5MB
8. 2. Binary Trees/7- Traversing Trees~.mp448.99MB
9. 2. Binary Trees/9- Recursion~.mp497.21MB
10. 2. Binary Trees/10- Depth First Traversals~.mp4109.13MB
11. 2. Binary Trees/11- Depth and Height of Nodes~.mp4107.22MB
12. 2. Binary Trees/12- Minimum Value in a Tree~.mp4175.04MB
13. 2. Binary Trees/13- Exercise- Equality Checking~.mp418.01MB
14. 2. Binary Trees/14- Solution- Equality Checking~.mp498.89MB
15. 2. Binary Trees/15- Exercise- Validating Binary Search Trees~.mp437.19MB
16. 2. Binary Trees/16- Solution- Validating Binary Search Trees~.mp4119.6MB
17. 2. Binary Trees/17- Exercise- Nodes at K Distance~.mp414.42MB
18. 2. Binary Trees/18- Solution- Nodes at K Distance from the Root~.mp4141.15MB
19. 2. Binary Trees/19- Level Order Traversal~.mp447.78MB
20. 2. Binary Trees/21- Summary~.mp413.25MB
21. 3. AVL Trees/1- Introduction~.mp42.78MB
22. 3. AVL Trees/2- Balanced and Unbalanced Trees~.mp442.98MB
23. 3. AVL Trees/3- Rotations~.mp443.74MB
24. 3. AVL Trees/4- AVL Trees~.mp428.34MB
25. 3. AVL Trees/6- Exercise- Building an AVL Tree~.mp417.31MB
26. 3. AVL Trees/7- Solution- insert()~.mp4233.44MB
27. 3. AVL Trees/8- Exercise- Height Calculation~.mp433.72MB
28. 3. AVL Trees/9- Solution- Height Calculation~.mp468.89MB
29. 3. AVL Trees/10- Exercise- Balance Factor~.mp445.24MB
30. 3. AVL Trees/11- Solution- Balance Factor~.mp4134.8MB
31. 3. AVL Trees/12- Exercise- Detecting Rotations~.mp430.97MB
32. 3. AVL Trees/13- Solution- Detecting Rotations~.mp4127.62MB
33. 3. AVL Trees/14- Exercise- Implementing Rotations~.mp481.03MB
34. 3. AVL Trees/15- Solution- Implementing Rotations~.mp4219.36MB
35. 3. AVL Trees/17- Summary~.mp47.62MB
36. 4. Heaps/1- Introduction~.mp41.88MB
37. 4. Heaps/2- What are Heaps~.mp444.23MB
38. 4. Heaps/4- Exercise- Building a Heap~.mp416.13MB
39. 4. Heaps/5- Solution- insert()~.mp4193.09MB
40. 4. Heaps/6- Solution- remove()~.mp4238.55MB
41. 4. Heaps/7- Solution - Edge Cases~.mp4229MB
42. 4. Heaps/8- Heap Sort~.mp454.03MB
43. 4. Heaps/9- Priority Queues~.mp4113.74MB
44. 4. Heaps/10- Exercise- Heapify~.mp418.14MB
45. 4. Heaps/11- Solution- Heapify~.mp4185.02MB
46. 4. Heaps/12- Solution- Optimization~.mp456.8MB
47. 4. Heaps/13- Exercise- Kth Largest Item~.mp46.86MB
48. 4. Heaps/14- Solution- Kth Largest Item~.mp496.91MB
49. 4. Heaps/16- Summary~.mp410.66MB
50. 5. Tries/1- Introduction~.mp42.2MB
51. 5. Tries/2- What are Tries~.mp463.22MB
52. 5. Tries/4- Exercise- Building a Trie~.mp421.4MB
53. 5. Tries/5- Solution- Building a Trie~.mp4127.9MB
54. 5. Tries/6- An Implementation with a HashTable~.mp453.01MB
55. 5. Tries/7- A Better Abstraction~.mp4206.3MB
56. 5. Tries/8- Exercise- Looking Up a Word~.mp420.81MB
57. 5. Tries/9- Solution- Looking Up a Word~.mp461.22MB
58. 5. Tries/10- Traversals~.mp481.77MB
59. 5. Tries/11- Exercise- Removing a Word~.mp412.38MB
60. 5. Tries/12- Solution- Removing a Word~.mp4226.91MB
61. 5. Tries/13- Exercise- Auto Completion~.mp416.62MB
62. 5. Tries/14- Solution- Auto Completion~.mp4175.16MB
63. 5. Tries/16- Summary~.mp47.35MB
64. 6. Graphs/1- Introduction~.mp42.15MB
65. 6. Graphs/2- What are Graphs~.mp415.92MB
66. 6. Graphs/3- Adjacency Matrix~.mp425.72MB
67. 6. Graphs/4- Adjacency List~.mp459.97MB
68. 6. Graphs/5- Exercise- Building a Graph~.mp415.3MB
69. 6. Graphs/6- Solution- Adding Nodes and Edges~.mp4203.81MB
70. 6. Graphs/7- Solution- Removing Nodes and Edges~.mp4110.15MB
71. 6. Graphs/8- Traversal Algorithms~.mp430.56MB
72. 6. Graphs/10- Exercise- Depth-first Traversal (Recursive)~.mp48.49MB
73. 6. Graphs/11- Solution- Depth-first Traversal (Recursive)~.mp499.2MB
74. 6. Graphs/12- Exercise- Depth-first Traversal (Iterative)~.mp450.43MB
75. 6. Graphs/13- Solution- Depth-first Traversal (Iterative)~.mp4116.51MB
76. 6. Graphs/14- Exercise- Breadth-first Traversal (Iterative)~.mp410.45MB
77. 6. Graphs/15- Solution- Breadth-first Traversal~.mp463.6MB
78. 6. Graphs/16- Exercise- Topological Sorting~.mp451.37MB
79. 6. Graphs/17- Solution- Topological Sort~.mp4110.96MB
80. 6. Graphs/18- Exercise- Cycle Detection (Directed Graphs)~.mp430.78MB
81. 6. Graphs/19- Solution- Cycle Detection (Directed Graphs)~.mp4174.44MB
82. 6. Graphs/20- Graphs Summary~.mp46.96MB
83. 7. Undirected Graphs/1- Introduction~.mp42.69MB
84. 7. Undirected Graphs/2- Exercise- Weighted Graphs~.mp410.49MB
85. 7. Undirected Graphs/3- Solution- Weighted Graphs~.mp4170.85MB
86. 7. Undirected Graphs/4- An Object-oriented Solution~.mp4243.51MB
87. 7. Undirected Graphs/5- Dijkstra_s Shortest Path Algorithm~.mp442.17MB
88. 7. Undirected Graphs/6- Exercise- Getting the Shortest Distance~.mp4146.74MB
89. 7. Undirected Graphs/7- Solution- The Shortest Distance~.mp4160.32MB
90. 7. Undirected Graphs/8- Solution- Shortest Path~.mp4267.25MB
91. 7. Undirected Graphs/9- Exercise- Cycle Detection (Undirected Graphs)~.mp415.79MB
92. 7. Undirected Graphs/10- Solution- Cycle Detection (Undirected Graphs)~.mp4111.08MB
93. 7. Undirected Graphs/11- Minimum Spanning Tree~.mp411.19MB
94. 7. Undirected Graphs/12- Exercise- Prim_s Algorithm~.mp419.86MB