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