种子简介

种子名称： [DesireCourse.Net] Udemy - Data Structures & Algorithms !
文件类型： 视频
文件数目： 239个文件
文件大小： 8.13 GB
收录时间： 2020-3-1 20:07
已经下载： 3次
资源热度： 66
最近下载： 2024-6-28 17:56

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:0129944011c59febd2781b58cfabb30331628674&dn=[DesireCourse.Net] Udemy - Data Structures & Algorithms ! 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[DesireCourse.Net] Udemy - Data Structures & Algorithms !.torrent

1. S01 -- Introduction to Data Structure & Algorithms/1. S01 - L01 -- Course Breakdown.mp427.05MB

1. S01 -- Introduction to Data Structure & Algorithms/2. S01 - L02 -- What is DS and Algo.mp437.85MB

1. S01 -- Introduction to Data Structure & Algorithms/3. S01 - L03 -- Why companies ask DS.mp416.34MB

1. S01 -- Introduction to Data Structure & Algorithms/4. S01 - L04 -- DS in every day life.mp420.73MB

1. S01 -- Introduction to Data Structure & Algorithms/5. S01 - L05 -- Types of DS.mp410.26MB

10. S08.03 -- AVL Tree/1. S08.03 - L01 -- Why learn AVL Tree.mp425.64MB

10. S08.03 -- AVL Tree/10. S08.03 - L10 -- Delete LL LR RR RL.mp439.77MB

10. S08.03 -- AVL Tree/11. S08.03 - L11 -- Delete End to End Case.mp464.15MB

10. S08.03 -- AVL Tree/12. S08.03 - L12 -- Delete AVL Tree & Tree Comparison.mp428.16MB

10. S08.03 -- AVL Tree/2. S08.03 - L02 -- What is AVL Tree.mp436.2MB

10. S08.03 -- AVL Tree/3. S08.03 - L03 -- Create Search Traverse AVL Tree.mp423.23MB

10. S08.03 -- AVL Tree/4. S08.03 - L04 -- Insert in AVL_LL Theory.mp438.25MB

10. S08.03 -- AVL Tree/5. S08.03 - L05 -- Insert in AVL_LL Algorithm.mp420.59MB

10. S08.03 -- AVL Tree/6. S08.03 - L06 -- Insert in AVL LR.mp434.41MB

10. S08.03 -- AVL Tree/7. S08.03 - L07 -- Insert in AVL RR.mp431.07MB

10. S08.03 -- AVL Tree/8. S08.03 - L08 -- Insert in AVL RL.mp423.83MB

10. S08.03 -- AVL Tree/9. S08.03 - L09 -- Insert End to End Case.mp464.13MB

11. S08.04 -- Binary Heap/1. S08.04 - L01 -- What Why and Type of Heap.mp448.97MB

11. S08.04 -- Binary Heap/2. S08.04 - L02 -- Create, Peek, Size of Heap.mp416.8MB

11. S08.04 -- Binary Heap/3. S08.04 - L03 -- Insert element in Heap.mp418.88MB

11. S08.04 -- Binary Heap/4. S08.04 - L04 -- Extract and Delete from Heap.mp419.67MB

11. S08.04 -- Binary Heap/5. S08.04 - L05 -- Why avoid Reference based implementation .mp415.3MB

12. S08.05 -- Trie/1. S08.05 - L01 -- What and Why of Trie.mp429.53MB

12. S08.05 -- Trie/2. S08.05 - L02 -- Create Insert in Trie.mp434.09MB

12. S08.05 -- Trie/3. S08.05 - L03 -- Search a String in Trie.mp412.13MB

12. S08.05 -- Trie/4. S08.05 - L04 -- Delete a String from Trie.mp442.83MB

12. S08.05 -- Trie/5. S08.05 - L05 -- Practical Uses of Trie.mp420.61MB

13. S09 -- Hashing/1. S09 - L01 -- Introduction to Hashing.mp45.56MB

13. S09 -- Hashing/2. S09 - L02 -- Why learn Hashing .mp48.85MB

13. S09 -- Hashing/3. S09 - L03 -- Introduction to Hash Functions.mp413.87MB

13. S09 -- Hashing/4. S09 - L04 -- Types of Collision Resolution Techniques.mp424.35MB

13. S09 -- Hashing/5. S09 - L05 -- What happens when Hash Table is full .mp47.03MB

13. S09 -- Hashing/6. S09 - L06 -- Collision Resolution Techniques Compared.mp413.63MB

13. S09 -- Hashing/7. S09 - L07 -- Practical Use of Hashing.mp411.34MB

13. S09 -- Hashing/8. S09 - L08 -- Hashing vs Other DS.mp47.85MB

14. S10 -- Sorting/1. S10 - L01 -- What and Why of Sorting.mp415.17MB

14. S10 -- Sorting/10. S10 - L09 -- Quick Sort Part#2.mp428.27MB

14. S10 -- Sorting/11. S10 - L10 -- HeapSort.mp459.9MB

14. S10 -- Sorting/12. S10 - L11 -- Sorting Techniques compared.mp48.87MB

14. S10 -- Sorting/2. S10 - L02 -- Types of Sorting Techniques.mp435.89MB

14. S10 -- Sorting/3. S10 - L03 -- Sorting Terminologies.mp418.79MB

14. S10 -- Sorting/4. S10 - L04 -- Bubble Sort.mp429.42MB

14. S10 -- Sorting/5. S10 - L05 -- Selection Sort.mp422.63MB

14. S10 -- Sorting/6. S10 - L06 -- Insertion Sort.mp432.56MB

14. S10 -- Sorting/7. S10 - L07 -- Bucket Sort.mp446.06MB

14. S10 -- Sorting/8. S10 - L08 -- Merge Sort.mp445.99MB

14. S10 -- Sorting/9. S10 - L09 -- Quick Sort Part#1.mp461.48MB

15. S11 -- Graph/1. S11 - L01 -- What and Why of Graphs.mp443.81MB

15. S11 -- Graph/10. S11 - L10 -- What is Topological Sort.mp415.67MB

15. S11 -- Graph/11. S11 - L11 -- Topological Sort Dry Run.mp434.96MB

15. S11 -- Graph/12. S11 - L12 -- Why Topological Sort Works.mp436.76MB

15. S11 -- Graph/13. S11 - L13 -- Topological Sort Algorithm.mp439.69MB

15. S11 -- Graph/14. S11 - L14 -- What is Single Source Shortest Path Problem(SSSP).mp435.39MB

15. S11 -- Graph/15. S11 - L15 -- BFS for SSSP.mp450.76MB

15. S11 -- Graph/16. S11 - L16 -- Why BFS does not works for Weighted Graph SSSP.mp418.19MB

15. S11 -- Graph/17. S11 - L17 -- Why DFS does not works for SSSP.mp411.49MB

15. S11 -- Graph/18. S11 - L18 -- Dijkstra for SSSP.mp461.63MB

15. S11 -- Graph/19. S11 - L19 -- Why Dijkstra does not work for Negative Cycle.mp427.36MB

15. S11 -- Graph/2. S11 - L02 -- Graph Terminologies.mp422.21MB

15. S11 -- Graph/20. S11 - L20 -- BellmanFord Dry run for SSSP.mp466.41MB

15. S11 -- Graph/21. S11 - L21 -- BellanFord Algorithm for SSSP.mp424.26MB

15. S11 -- Graph/22. S11 - L22 -- How Bellman Ford works for Negative Cycle.mp473.7MB

15. S11 -- Graph/23. S11 - L23 -- Why BellmanFord runs for V-1 times.mp459.8MB

15. S11 -- Graph/24. S11 - L24 -- BFS vs Dijkstra vs BellmanFord.mp429.94MB

15. S11 -- Graph/25. S11 - L25 -- What is All Pair Shortest Path Problem(APSP).mp438.49MB

15. S11 -- Graph/26. S11 - L26 -- Dry run of BFS Dijkstra Bellman for APSP.mp424.29MB

15. S11 -- Graph/27. S11 - L27 -- Floyd Warshall Algorithm for APSP.mp465.78MB

15. S11 -- Graph/28. S11 - L28 -- Why Floyd Warshall Algorithm always works.mp445.31MB

15. S11 -- Graph/29. S11 - L29 -- Why Floyd does not works for Negative Cycle.mp416.33MB

15. S11 -- Graph/3. S11 - L03 -- Types of Graphs.mp415.68MB

15. S11 -- Graph/30. S11 - L30 -- BFS vs Dijkstra vs Bellman vs Floys.mp435.47MB

15. S11 -- Graph/31. S11 - L31 -- What is Minimum Spanning Tree (MST).mp428.56MB

15. S11 -- Graph/32. S11 - L32.1 -- DisjointSet.mp442.1MB

15. S11 -- Graph/33. S11 - L32.2 -- Kruskals Algorithm.mp470.91MB

15. S11 -- Graph/34. S11 - L33 -- Prims Algorithm Dry Run.mp429.94MB

15. S11 -- Graph/35. S11 - L34 -- Prims Algorithm Explained.mp431.97MB

15. S11 -- Graph/36. S11 - L35 -- Prims vs Kruskal.mp411.09MB

15. S11 -- Graph/4. S11 - L04 -- Graph Representation in Code.mp431.05MB

15. S11 -- Graph/5. S11 - L05 -- BFS Algorithm.mp438.57MB

15. S11 -- Graph/6. S11 - L06 -- BFS Time Complexity.mp434.82MB

15. S11 -- Graph/7. S11 - L07 -- DFS Algorithm.mp438.72MB

15. S11 -- Graph/8. S11 - L08 -- DFS Time Complexity.mp433.4MB

15. S11 -- Graph/9. S11 - L09 -- BFS vs DFS.mp422.41MB

16. S12.1 -- Magic Framework/1. S12.1 - L01 -- Magic Framework.mp415.72MB

17. S12.2 -- Greedy Algorithm/1. S12.2 - L01 -- Greedy Algo Introduction.mp440.26MB

17. S12.2 -- Greedy Algorithm/2. S12.2 - L02 -- Known Algos.mp441.51MB

17. S12.2 -- Greedy Algorithm/3. S12.2 - L03 -- Activity Selection Problem.mp435.38MB

17. S12.2 -- Greedy Algorithm/4. S12.2 - L04 -- Coin Change Problem.mp441.23MB

17. S12.2 -- Greedy Algorithm/5. S12.2 - L05 -- Fractional Knapsack Problem.mp464.33MB

18. S12.3 -- Divide & Conquer/1. S12.3 - L01 -- What and Why of Divide&Conquer.mp429.36MB

18. S12.3 -- Divide & Conquer/10. S12.3 - L10 -- Longest Palindromic Substring.mp447.76MB

18. S12.3 -- Divide & Conquer/11. S12.3 - L11 -- Min Cost to Reach End of Array.mp433.82MB

18. S12.3 -- Divide & Conquer/12. S12.3 - L12 -- Number of Paths to reach last cell with given Cost.mp455.28MB

18. S12.3 -- Divide & Conquer/2. S12.3 - L02 -- Binary Search, Quick, Merge Sortt.mp421.58MB

18. S12.3 -- Divide & Conquer/3. S12.3 - L03 -- Fibonacci Series.mp412.62MB

18. S12.3 -- Divide & Conquer/4. S12.3 - L04 -- Number Factor.mp444.42MB

18. S12.3 -- Divide & Conquer/5. S12.3 - L05 -- House thief.mp436.24MB

18. S12.3 -- Divide & Conquer/6. S12.3 - L06 -- Convert One String to Another.mp459.85MB

18. S12.3 -- Divide & Conquer/7. S12.3 - L07 -- Zero-One Knapsack.mp436.23MB

18. S12.3 -- Divide & Conquer/8. S12.3 - L08 -- Longest Common Subsequence.mp444.33MB

18. S12.3 -- Divide & Conquer/9. S12.3 - L09 -- Longest Palindromic Subsequence.mp448.52MB

19. S12.4 -- Dynamic Programming/1. S12.4 - L01 -- What and Why of Dynamic Programming.mp426.93MB

19. S12.4 -- Dynamic Programming/10. S12.4 - L10 -- Longest Palindromic Subsequence.mp488.35MB

19. S12.4 -- Dynamic Programming/11. S12.4 - L11 -- Longest Palindromic Substring.mp4105.2MB

19. S12.4 -- Dynamic Programming/12. S12.4 - L12 -- Min Cost to Reach End of Array.mp491.31MB

19. S12.4 -- Dynamic Programming/13. S12.4 - L13 -- Ways to Reach last cell.mp4169.57MB

19. S12.4 -- Dynamic Programming/2. S12.4 - L02 -- Top Down Approach.mp428.26MB

19. S12.4 -- Dynamic Programming/3. S12.4 - L03 -- Bottom Up Approach.mp435.22MB

19. S12.4 -- Dynamic Programming/4. S12.4 - L04 -- Is Merge Sort Dynamic Programming .mp417.12MB

19. S12.4 -- Dynamic Programming/5. S12.4 - L05 -- Number Factor Problem.mp495.71MB

19. S12.4 -- Dynamic Programming/6. S12.4 - L06 -- HouseThief Problem.mp488.62MB

19. S12.4 -- Dynamic Programming/7. S12.4 - L07 -- Convert One String to Another.mp483.2MB

19. S12.4 -- Dynamic Programming/8. S12.4 - L08 -- Zero One Knapsack Problem.mp496.97MB

19. S12.4 -- Dynamic Programming/9. S12.4 - L09 -- Longest Common Subsequence.mp474.14MB

2. S01.1 -- Recursion/1. S01.1-L01--What is Recursion.mp458.69MB

2. S01.1 -- Recursion/2. S01.1-L02--Why learn Recursion.mp415.07MB

2. S01.1 -- Recursion/3. S01.1-L03--Format of Recursion Method.mp412.45MB

2. S01.1 -- Recursion/4. S01.1-L04--How Recurssion works internally.mp454.71MB

2. S01.1 -- Recursion/5. S01.1-L05--Finding Factorial using Recursion.mp426.55MB

2. S01.1 -- Recursion/6. S01.1-L06--Finding Fibonacci using Recursion.mp425.03MB

2. S01.1 -- Recursion/7. S01.1-L07--Recursion vs Iteration.mp410.34MB

2. S01.1 -- Recursion/8. S01.1-L08--When to Use & Avoid Recursion.mp413.55MB

2. S01.1 -- Recursion/9. S01.1-L09--Practical Uses of Recursion.mp47.87MB

3. S02 -- Algorithm Run Time Analysis/1. S02-L01 -- What is Algo Run Time Analysis.mp413.72MB

3. S02 -- Algorithm Run Time Analysis/2. S02-L02 -- What are Notations.mp475.41MB

3. S02 -- Algorithm Run Time Analysis/3. S02-L03 -- Examples of Notations.mp428.39MB

3. S02 -- Algorithm Run Time Analysis/4. S02-L04 -- Examples of Time Complexity.mp434.62MB

3. S02 -- Algorithm Run Time Analysis/5. S02-L05 -- Finding Time Complexity of Iterative Algo.mp439.51MB

3. S02 -- Algorithm Run Time Analysis/6. S02-L06 -- Finding Time Complexity of Recursive Algo#1.mp445.04MB

3. S02 -- Algorithm Run Time Analysis/7. S02-L07 -- Finding Time Complexity of Recursive Algo#2.mp476.98MB

4. S03 -- Array/1. S03 - L01 -- What and Why of Array.mp436.21MB

4. S03 -- Array/10. S03 - L10 -- 2D Array operations.mp457.93MB

4. S03 -- Array/11. S03 - L11 -- Time Complexity of 2D Array.mp415.39MB

4. S03 -- Array/12. S03 - L12 -- When to use Array.mp418.45MB

4. S03 -- Array/13. S03 - L13 -- Code 2D Array.mp4112.42MB

4. S03 -- Array/14. S03 - L14 -- Practical uses of Array.mp431.96MB

4. S03 -- Array/2. S03 - L02 -- Types of Array.mp452.74MB

4. S03 -- Array/3. S03 - L03 -- How is Array represented in Memory.mp436.79MB

4. S03 -- Array/4. S03 - L04 -- Create an Array.mp460.68MB

4. S03 -- Array/5. S03 - L05 -- Insert Traverse in 1D Array.mp424.61MB

4. S03 -- Array/6. S03 - L06 -- Access Search Delete in 1D Array.mp463.11MB

4. S03 -- Array/7. S03 - L07 -- Code 1D Array.mp493.31MB

4. S03 -- Array/8. S03 - L08 -- Time Complexity of 1D Array.mp419.7MB

4. S03 -- Array/9. S03 - L09 -- Create 2D Array.mp448.75MB

5. S04 -- Linked List/1. S04 - L01 -- What is linked list.mp442.33MB

5. S04 -- Linked List/10. S04 - L10 -- Traversal of SLL.mp414.71MB

5. S04 -- Linked List/11. S04 - L11 -- Search node in SLL.mp420.36MB

5. S04 -- Linked List/12. S04 - L12 -- Deletion of node from SLL - Dry Run.mp439.76MB

5. S04 -- Linked List/13. S04 - L13 -- Deletion of node from SLL - Algo.mp455.27MB

5. S04 -- Linked List/14. S04 - L14 -- Delete entire SLL.mp411.62MB

5. S04 -- Linked List/15. S04 - L15 -- Time Complexity of SLL.mp419.05MB

5. S04 -- Linked List/16. S04 - L16 -- Creation of Circular Single LinkedList (CSLL).mp416.01MB

5. S04 -- Linked List/17. S04 - L17 -- Insertion of data in CSLL - Dry Run.mp427.74MB

5. S04 -- Linked List/18. S04 - L18 -- Insertion of data in CSLL - Algo.mp444.14MB

5. S04 -- Linked List/19. S04 - L19 -- Traverse CSLL.mp410.11MB

5. S04 -- Linked List/2. S04 - L02 -- Linked list vs Array.mp419.29MB

5. S04 -- Linked List/20. S04 - L20 -- Search a node in CSLL.mp419.93MB

5. S04 -- Linked List/21. S04 - L21 -- Delete a node from CSLL - Dry Run.mp423.48MB

5. S04 -- Linked List/22. S04 - L22 -- Deletion of node from CSLL - Algo.mp447.84MB

5. S04 -- Linked List/23. S04 - L23 -- Deletion of entire CSLL.mp415.2MB

5. S04 -- Linked List/24. S04 - L24 -- Time Complexity of CSLL.mp424.18MB

5. S04 -- Linked List/25. S04 - L25 -- Create Double Linked List (DLL).mp425.61MB

5. S04 -- Linked List/26. S04 - L26 -- Insert node in DLL - Dry Run.mp435.05MB

5. S04 -- Linked List/27. S04 - L27 -- Insert node in DLL - Algo.mp476.55MB

5. S04 -- Linked List/28. S04 - L28 -- Traverse DLL.mp49.4MB

5. S04 -- Linked List/29. S04 - L29 -- Reverse Traversal of DLL.mp413.29MB

5. S04 -- Linked List/3. S04 - L03 -- Components of LinkedList.mp426.21MB

5. S04 -- Linked List/30. S04 - L30 -- Search a node in DLL.mp413.1MB

5. S04 -- Linked List/31. S04 - L31 -- Delete a node from DLL - Dry Run.mp429.5MB

5. S04 -- Linked List/32. S04 - L32 -- Delete a node from DLL - Algo.mp465.49MB

5. S04 -- Linked List/33. S04 - L33 -- Delete entire DLL.mp417.5MB

5. S04 -- Linked List/34. S04 - L34 -- Time Complexity of DLL.mp421.29MB

5. S04 -- Linked List/35. S04 - L35 -- Create Double Circular LinkedList (CDLL).mp434.18MB

5. S04 -- Linked List/36. S04 - L36 -- Insert node in CDLL - Dry Run.mp451.09MB

5. S04 -- Linked List/37. S04 - L37 -- Insert node in CDLL - Algo.mp459.92MB

5. S04 -- Linked List/38. S04 - L38 -- Traverse CDLL.mp414MB

5. S04 -- Linked List/39. S04 - L39 -- Reverse traverse CDLL.mp414.05MB

5. S04 -- Linked List/4. S04 - L04 -- Types of LinkedList.mp433MB

5. S04 -- Linked List/40. S04 - L40 -- Search a node in CDLL.mp418.35MB

5. S04 -- Linked List/41. S04 - L41 -- Delete a node from CDLL - Dry Run.mp438.39MB

5. S04 -- Linked List/42. S04 - L42 -- Delete a node from CDLL - Algo.mp477.4MB

5. S04 -- Linked List/43. S04 - L43 -- Delete entire CDLL.mp425.03MB

5. S04 -- Linked List/44. S04 - L44 -- Time Complexity of CDLL.mp423.99MB

5. S04 -- Linked List/45. S04 - L45 -- SLL vs CSLL vs DLL vs DLL.mp450.79MB

5. S04 -- Linked List/46. S04 - L46 -- Practical uses of LinkedList.mp435.91MB

5. S04 -- Linked List/5. S04 - L05 -- Why so many types of LinkedList.mp457.22MB

5. S04 -- Linked List/6. S04 - L06 -- How is LinkedList stored in Memory.mp424.33MB

5. S04 -- Linked List/7. S04 - L07 -- Creation of Single LinkedList (SLL).mp419.65MB

5. S04 -- Linked List/8. S04 - L08 -- Insertion in SLL - Dry Run.mp432.34MB

5. S04 -- Linked List/9. S04 - L09 -- Insertion in SLL - Algo.mp466.71MB

6. S05 -- Stack/1. L01 -- What and Why of Stack.mp427.82MB

6. S05 -- Stack/2. L02 -- ARRAY - Create & Push.mp422.65MB

6. S05 -- Stack/3. L03 -- ARRAY - Pop, Peek, isEmpty, isFull, Delete.mp430.37MB

6. S05 -- Stack/4. L04 -- LinkedList - Create, Push, Pop.mp428.72MB

6. S05 -- Stack/5. L05 -- LinkedList - Peek, Delete.mp423.86MB

6. S05 -- Stack/6. L06 -- When to use or avoid Stack.mp412.86MB

7. S06 -- Queue/1. S06 - L01 -- What and Why of Queue.mp427.86MB

7. S06 -- Queue/10. S06 - L10 -- LINEAR QUEUE(LL) - Peek, isEmpty, Delete.mp417.49MB

7. S06 -- Queue/11. S06 - L11 -- Array vs LinkedList Implementation.mp422.58MB

7. S06 -- Queue/2. S06 - L02 -- LINEAR QUEUE(Array) - Create, Enqueue.mp425.56MB

7. S06 -- Queue/3. S06 - L03 -- LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete.mp431.08MB

7. S06 -- Queue/4. S06 - L04 -- Why Circular Queue.mp417.8MB

7. S06 -- Queue/5. S06 - L05 -- CIRCULAR QUEUE(Array) - Enqueue.mp424.46MB

7. S06 -- Queue/6. S06 - L06 -- CIRCULAR QUEUE(Array) - Dequeue.mp418.04MB

7. S06 -- Queue/7. S06 - L07 -- CIRCULAR QUEUE(Array) - Peek, isEmpty, isFull, Delete.mp423.95MB

7. S06 -- Queue/8. S06 - L08 -- LINEAR QUEUE(LL) - Enqueue.mp427.17MB

7. S06 -- Queue/9. S06 - L09 -- LINEAR QUEUE(LL) - DeQueue.mp415.86MB

8. S08.01 -- Binary Tree/1. S08.01 - L01 -- What is Tree.mp438.55MB

8. S08.01 -- Binary Tree/10. S08.01 - L09 -- In-order traversal Binary Tree(LL).mp429.14MB

8. S08.01 -- Binary Tree/11. S08.01 - L10 -- Post-order traversal Binary Tree(LL).mp428.57MB

8. S08.01 -- Binary Tree/12. S08.01 - L11 -- Level-order traversal Binary Tree(LL).mp435.9MB

8. S08.01 -- Binary Tree/13. S08.01 - L12 -- Search for value in Binary Tree(LL).mp435.65MB

8. S08.01 -- Binary Tree/14. S08.01 - L13 -- Insert value in Binary Tree(LL).mp425.19MB

8. S08.01 -- Binary Tree/15. S08.01 - L14 -- Delete value from Binary Tree(LL).mp429.19MB

8. S08.01 -- Binary Tree/16. S08.01 - L15 -- Delete Binary Tree(LL).mp414.85MB

8. S08.01 -- Binary Tree/17. S08.01 - L16 -- Create Binary Tree(Array).mp419.65MB

8. S08.01 -- Binary Tree/18. S08.01 - L17 -- Insert value in Binary Tree(Array).mp426.67MB

8. S08.01 -- Binary Tree/19. S08.01 - L18 -- Search for value in Binary Tree(Array).mp416.06MB

8. S08.01 -- Binary Tree/2. S08.01 - L02 -- Why learn Tree.mp48.63MB

8. S08.01 -- Binary Tree/20. S08.01 - L19 -- Inorder traversal of Binary Tree(Array).mp431.83MB

8. S08.01 -- Binary Tree/21. S08.01 - L20 -- Pre-order traversal of Binary Tree(Array).mp419.18MB

8. S08.01 -- Binary Tree/22. S08.01 - L21 -- Post-order traversal of Binary Tree(Array).mp421.82MB

8. S08.01 -- Binary Tree/23. S08.01 - L22 -- Level-order traversal of Binary Tree(Array).mp411.19MB

8. S08.01 -- Binary Tree/24. S08.01 - L23 -- Delete node from Binary Tree(Array).mp424.93MB

8. S08.01 -- Binary Tree/25. S08.01 - L24 -- Delete Binary Tree(Array).mp414.54MB

8. S08.01 -- Binary Tree/26. S08.01 - L25 -- Binary Tree (Array vs Linked List).mp430.66MB

8. S08.01 -- Binary Tree/3. S08.01 - L03 -- Tree Terminologies - Part#1.mp440.4MB

8. S08.01 -- Binary Tree/4. S08.01 - L03 -- Tree Terminologies - Part#2.mp419.69MB

8. S08.01 -- Binary Tree/5. S08.01 - L04 -- What & Why of Binary Ttree.mp414.12MB

8. S08.01 -- Binary Tree/6. S08.01 - L05 -- Types of Binary Tree.mp424.3MB

8. S08.01 -- Binary Tree/7. S08.01 - L06 -- How is Tree Represented in Code.mp438.33MB

8. S08.01 -- Binary Tree/8. S08.01 - L07 -- Create blank Binary Tree(LL).mp49.08MB

8. S08.01 -- Binary Tree/9. S08.01 - L08 -- Pre-order traversal Binary Tree(LL).mp476.11MB

9. S08.02 -- Binary Search Tree (BST)/1. S08.02 - L01 -- What & Why of BST.mp418.38MB

9. S08.02 -- Binary Search Tree (BST)/2. S08.02 - L02 -- Creation & Searching in BST.mp440.19MB

9. S08.02 -- Binary Search Tree (BST)/3. S08.02 - L03 -- Traversing a BST.mp431.95MB

9. S08.02 -- Binary Search Tree (BST)/4. S08.02 - L04 -- Inserting a node in BST.mp470.08MB

9. S08.02 -- Binary Search Tree (BST)/5. S08.02 - L05 -- Deleting a node from BST.mp480.92MB

9. S08.02 -- Binary Search Tree (BST)/6. S08.02 - L06 -- Deleting a BST.mp413.47MB