Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай The Ultimate Data Structures & Algorithms: Part 2, а также все другие курсы, прямо сейчас!
Премиум
  1. Урок 1. 00:00:51
    Introduction
  2. Урок 2. 00:00:56
    Introduction
  3. Урок 3. 00:05:37
    What are Trees
  4. Урок 4. 00:02:42
    Exercise- Building a Tree
  5. Урок 5. 00:07:45
    Solution- insert()
  6. Урок 6. 00:02:01
    Solution- find()
  7. Урок 7. 00:05:59
    Traversing Trees
  8. Урок 8. 00:05:40
    Recursion
  9. Урок 9. 00:05:24
    Depth First Traversals
  10. Урок 10. 00:07:07
    Depth and Height of Nodes
  11. Урок 11. 00:07:38
    Minimum Value in a Tree
  12. Урок 12. 00:00:46
    Exercise- Equality Checking
  13. Урок 13. 00:04:09
    Solution- Equality Checking
  14. Урок 14. 00:04:15
    Exercise- Validating Binary Search Trees
  15. Урок 15. 00:04:19
    Solution- Validating Binary Search Trees
  16. Урок 16. 00:01:49
    Exercise- Nodes at K Distance
  17. Урок 17. 00:04:38
    Solution- Nodes at K Distance from the Root
  18. Урок 18. 00:02:56
    Level Order Traversal
  19. Урок 19. 00:01:23
    Summary
  20. Урок 20. 00:00:32
    Introduction
  21. Урок 21. 00:03:02
    Balanced and Unbalanced Trees
  22. Урок 22. 00:05:03
    Rotations
  23. Урок 23. 00:04:05
    AVL Trees
  24. Урок 24. 00:01:12
    Exercise- Building an AVL Tree
  25. Урок 25. 00:08:48
    Solution- insert()
  26. Урок 26. 00:01:25
    Exercise- Height Calculation
  27. Урок 27. 00:02:44
    Solution- Height Calculation
  28. Урок 28. 00:02:05
    Exercise- Balance Factor
  29. Урок 29. 00:04:02
    Solution- Balance Factor
  30. Урок 30. 00:02:55
    Exercise- Detecting Rotations
  31. Урок 31. 00:03:34
    Solution- Detecting Rotations
  32. Урок 32. 00:03:52
    Exercise- Implementing Rotations
  33. Урок 33. 00:05:41
    Solution- Implementing Rotations
  34. Урок 34. 00:01:02
    Summary
  35. Урок 35. 00:00:22
    Introduction
  36. Урок 36. 00:06:29
    What are Heaps
  37. Урок 37. 00:01:56
    Exercise- Building a Heap
  38. Урок 38. 00:08:25
    Solution- insert()
  39. Урок 39. 00:07:08
    Solution- remove()
  40. Урок 40. 00:06:12
    Solution - Edge Cases
  41. Урок 41. 00:02:30
    Heap Sort
  42. Урок 42. 00:05:05
    Priority Queues
  43. Урок 43. 00:01:27
    Exercise- Heapify
  44. Урок 44. 00:07:13
    Solution- Heapify
  45. Урок 45. 00:02:43
    Solution- Optimization
  46. Урок 46. 00:00:32
    Exercise- Kth Largest Item
  47. Урок 47. 00:03:48
    Solution- Kth Largest Item
  48. Урок 48. 00:01:20
    Summary
  49. Урок 49. 00:00:31
    Introduction
  50. Урок 50. 00:03:51
    What are Tries
  51. Урок 51. 00:03:04
    What are Tries
  52. Урок 52. 00:05:45
    Solution- Building a Trie
  53. Урок 53. 00:01:51
    An Implementation with a HashTable
  54. Урок 54. 00:05:29
    A Better Abstraction
  55. Урок 55. 00:01:13
    Exercise- Looking Up a Word
  56. Урок 56. 00:02:36
    Solution- Looking Up a Word
  57. Урок 57. 00:03:36
    Traversals
  58. Урок 58. 00:01:54
    Exercise- Removing a Word
  59. Урок 59. 00:08:15
    Solution- Removing a Word
  60. Урок 60. 00:02:52
    Exercise- Auto Completion
  61. Урок 61. 00:06:00
    Solution- Auto Completion
  62. Урок 62. 00:00:46
    Summary
  63. Урок 63. 00:00:27
    Introduction
  64. Урок 64. 00:02:10
    What are Graphs
  65. Урок 65. 00:04:15
    Adjacency Matrix
  66. Урок 66. 00:06:33
    Adjacency List
  67. Урок 67. 00:01:51
    Exercise- Building a Graph
  68. Урок 68. 00:07:35
    Solution- Adding Nodes and Edges
  69. Урок 69. 00:04:49
    Solution- Removing Nodes and Edges
  70. Урок 70. 00:03:59
    Traversal Algorithms
  71. Урок 71. 00:01:30
    Exercise- Depth-first Traversal (Recursive)
  72. Урок 72. 00:03:45
    Solution- Depth-first Traversal (Recursive)
  73. Урок 73. 00:02:45
    Exercise- Depth-first Traversal (Iterative)
  74. Урок 74. 00:04:00
    Solution- Depth-first Traversal (Iterative)
  75. Урок 75. 00:01:19
    Exercise- Breadth-first Traversal (Iterative)
  76. Урок 76. 00:02:42
    Solution- Breadth-first Traversal
  77. Урок 77. 00:05:07
    Exercise- Topological Sorting
  78. Урок 78. 00:04:06
    Solution- Topological Sort
  79. Урок 79. 00:03:43
    Exercise- Cycle Detection (Directed Graphs)
  80. Урок 80. 00:06:27
    Solution- Cycle Detection (Directed Graphs)
  81. Урок 81. 00:01:03
    Graphs Summary
  82. Урок 82. 00:00:27
    Introduction
  83. Урок 83. 00:01:31
    Exercise- Weighted Graphs
  84. Урок 84. 00:05:21
    Solution- Weighted Graphs
  85. Урок 85. 00:06:14
    An Object-oriented Solution
  86. Урок 86. 00:04:36
    Dijkstra's Shortest Path Algorithm
  87. Урок 87. 00:06:09
    Exercise- Getting the Shortest Distance
  88. Урок 88. 00:05:28
    Solution- The Shortest Distance
  89. Урок 89. 00:07:54
    Solution- Shortest Path
  90. Урок 90. 00:02:04
    Exercise- Cycle Detection (Undirected Graphs)
  91. Урок 91. 00:04:43
    Solution- Cycle Detection (Undirected Graphs)
  92. Урок 92. 00:01:57
    Minimum Spanning Tree
  93. Урок 93. 00:02:46
    Exercise- Prim's Algorithm
  94. Урок 94. 00:10:40
    Solution- Prim's Algorithm