Удален по просьбе правообладателя
  1. Урок 1.00:01:35
    Introduction
  2. Урок 2.00:04:57
    Binary Search Tree Overview
  3. Урок 3.00:07:58
    Traversals
  4. Урок 4.00:10:38
    Deletions & Insertions
  5. Урок 5.00:11:46
    Balance Factor
  6. Урок 6.00:10:39
    AVL Complexity
  7. Урок 7.00:04:26
    Red-Black Trees
  8. Урок 8.00:04:58
    M-Way Tree Structure
  9. Урок 9.00:05:47
    B-Trees
  10. Урок 10.00:07:18
    B-Tree Insertions
  11. Урок 11.00:07:21
    B-Tree Leaf Deletion
  12. Урок 12.00:06:03
    B-Tree Internal Deletion
  13. Урок 13.00:04:56
    Graphs Overview
  14. Урок 14.00:04:14
    Adjacency Lists & Matrices
  15. Урок 15.00:07:20
    Breadth-First Search
  16. Урок 16.00:05:28
    Depth-First Search
  17. Урок 17.00:12:50
    Spanning Trees & Prim's Algorithm
  18. Урок 18.00:08:25
    Priority Queues
  19. Урок 19.00:16:02
    Kruskal Algorithm
  20. Урок 20.00:04:56
    Ford-Fulkerson: Max Flow
  21. Урок 21.00:08:01
    Ford-Fulkerson: Min Cut
  22. Урок 22.00:03:56
    Factorials & Fibonacci
  23. Урок 23.00:04:40
    Max Subarray
  24. Урок 24.00:13:49
    Coin Change Problem
  25. Урок 25.00:07:20
    Bloom Filter
  26. Урок 26.00:05:21
    Wrapping Up