1. Урок 1.00:01:14
    Introduction
  2. Урок 2.00:03:55
    Why to use data structures
  3. Урок 3.00:03:59
    Data structures and abstract data types
  4. Урок 4.00:05:56
    Arrays introduction - basics
  5. Урок 5.00:05:55
    Arrays introduction - operations
  6. Урок 6.00:09:53
    Using arrays
  7. Урок 7.00:08:44
    ArraysLists in Java
  8. Урок 8.00:03:07
    Reversing an array in-place solution
  9. Урок 9.00:03:52
    Anagram problem solution
  10. Урок 10.00:07:57
    Duplicates in an array problem solution
  11. Урок 11.00:06:21
    Reservoir sampling solution
  12. Урок 12.00:07:10
    Linked lists theory - basics
  13. Урок 13.00:09:33
    Linked list theory - operations
  14. Урок 14.00:01:41
    Linked list theory - doubly linked lists
  15. Урок 15.00:06:37
    Linked list theory - linked lists versus arrays
  16. Урок 16.00:04:48
    Linked list implementation I
  17. Урок 17.00:11:42
    Linked list implementation II
  18. Урок 18.00:07:56
    Linked list implementation III
  19. Урок 19.00:06:00
    Doubly linked list introduction
  20. Урок 20.00:08:15
    Linked lists in java.util
  21. Урок 21.00:05:18
    Practical (real-world) applications of linked lists
  22. Урок 22.00:05:31
    Finding the middle node in a linked list solution
  23. Урок 23.00:07:34
    Reverse a linked list in-place solution
  24. Урок 24.00:04:02
    Stack introduction
  25. Урок 25.00:07:24
    Stacks in memory management ( stacks, heaps )
  26. Урок 26.00:07:03
    Stacks and recursive method calls
  27. Урок 27.00:07:29
    Stack implementation with linked list I
  28. Урок 28.00:03:39
    Stack implementation with linked list II
  29. Урок 29.00:11:03
    Stack implementation with arrays
  30. Урок 30.00:01:19
    Dijkstra's interpreter introduction
  31. Урок 31.00:09:13
    Dijkstra's interpreter implementation
  32. Урок 32.00:05:11
    Java built in java.util.Stack
  33. Урок 33.00:03:21
    Practical (real-world) applications of stacks
  34. Урок 34.00:05:14
    Queues introduction
  35. Урок 35.00:09:44
    Queue implementation with linked list
  36. Урок 36.00:06:33
    Java built in java.util.Queue
  37. Урок 37.00:05:50
    Max in a stack problem solution
  38. Урок 38.00:05:50
    Stack with queue solution
  39. Урок 39.00:04:54
    Stack with queue solution - recursion
  40. Урок 40.00:10:25
    Binary search trees theory - basics
  41. Урок 41.00:04:27
    Binary search trees theory - search, insert
  42. Урок 42.00:06:09
    Binary search trees theory - delete
  43. Урок 43.00:04:26
    Binary search trees theory - in-order traversal
  44. Урок 44.00:02:12
    Binary search trees theory - running times
  45. Урок 45.00:07:03
    Binary search trees implementation I - Node, Tree
  46. Урок 46.00:09:56
    Binary search trees implementation II - insertion
  47. Урок 47.00:07:25
    Binary search tree implementation III - maximum, minimum
  48. Урок 48.00:05:43
    Binary search tree implementation IV - traversal
  49. Урок 49.00:09:26
    Binary search tree implementation V - remove
  50. Урок 50.00:05:55
    Binary search tree implementation VI - remove II
  51. Урок 51.00:06:45
    Custom objects in a tree
  52. Урок 52.00:03:07
    Practical (real-world) applications of trees
  53. Урок 53.00:05:16
    Compare binary trees solution
  54. Урок 54.00:11:31
    k-th smallest element in a search tree solution
  55. Урок 55.00:09:48
    Family age problem solution
  56. Урок 56.00:04:14
    AVL trees introduction - motivation
  57. Урок 57.00:05:22
    AVL trees introduction - basics
  58. Урок 58.00:08:45
    AVL trees introduction - height
  59. Урок 59.00:10:18
    AVL trees introduction - rotations cases
  60. Урок 60.00:10:51
    AVL trees introduction - illustration
  61. Урок 61.00:03:39
    AVL trees introduction - sorting
  62. Урок 62.00:03:22
    AVL implementation - Node and Tree
  63. Урок 63.00:04:46
    AVL implementation - balance and height parameters
  64. Урок 64.00:07:37
    AVL implementation - implementing the rotations
  65. Урок 65.00:06:04
    AVL implementation - insertion I
  66. Урок 66.00:08:53
    AVL implementation - insertion II
  67. Урок 67.00:03:20
    AVL implementation - testing
  68. Урок 68.00:06:36
    AVL tree remove introduction
  69. Урок 69.00:08:32
    AVL tree remove implementation I
  70. Урок 70.00:03:56
    AVL tree generic implementation
  71. Урок 71.00:10:39
    Red-black trees introduction - basics
  72. Урок 72.00:04:16
    The logic behind red-black trees
  73. Урок 73.00:05:11
    Red-black trees rotations- cases I
  74. Урок 74.00:04:26
    Red-black trees rotations- cases II
  75. Урок 75.00:03:18
    Red-black trees rotations- cases III
  76. Урок 76.00:02:47
    Red-black trees rotations- cases IV
  77. Урок 77.00:04:48
    Red-black trees introduction - example I
  78. Урок 78.00:04:20
    Red-black trees introduction - example II
  79. Урок 79.00:03:26
    Red-black tree versus AVL tree
  80. Урок 80.00:04:29
    Red-black tree implementation I - Node class
  81. Урок 81.00:02:07
    Red-black tree implementation II - traverse
  82. Урок 82.00:03:41
    Red-black tree implementation III - insert
  83. Урок 83.00:05:49
    Red-black tree implementation IV - rotate left / right
  84. Урок 84.00:09:53
    Red-black tree implementation V - fixing the violations
  85. Урок 85.00:05:54
    Red-black tree implementation VI - fixing the violations
  86. Урок 86.00:02:01
    Red-black tree implementation VII - testing
  87. Урок 87.00:12:50
    Splay tree introduction I - basics
  88. Урок 88.00:03:53
    Splay tree introduction II - example
  89. Урок 89.00:09:45
    Splay tree implementation I - find, rotate
  90. Урок 90.00:05:51
    Splay tree implementation II - splaying
  91. Урок 91.00:03:36
    Splay tree implementation III - testing
  92. Урок 92.00:13:02
    B-tree introduction - basics
  93. Урок 93.00:04:08
    B-tree and external memory
  94. Урок 94.00:05:42
    Disk access times
  95. Урок 95.00:02:48
    B-tree introduction - search
  96. Урок 96.00:07:11
    B-tree introduction - insertion
  97. Урок 97.00:05:32
    B-tree introduction - deletion
  98. Урок 98.00:04:07
    In-order traversal
  99. Урок 99.00:08:14
    Priority queues introduction
  100. Урок 100.00:08:15
    Heap introduction - basics
  101. Урок 101.00:09:18
    Heap introduction - array representation
  102. Урок 102.00:04:44
    Heap introduction - remove operation
  103. Урок 103.00:05:14
    Heap introduction - heapsort
  104. Урок 104.00:05:06
    Heap introduction - running times
  105. Урок 105.00:03:00
    Other types of heaps: binomial and Fibonacci heap
  106. Урок 106.00:08:29
    Heap implementation I
  107. Урок 107.00:06:39
    Heap implementation II
  108. Урок 108.00:05:01
    Heap implementation III
  109. Урок 109.00:08:34
    Heaps in java.util.PriorityQueue
  110. Урок 110.00:06:43
    Checking array heap representation solution
  111. Урок 111.00:06:42
    Converting max heap to min heap solution
  112. Урок 112.00:02:38
    Associative array ADT
  113. Урок 113.00:09:06
    Hashtables introduction - basics
  114. Урок 114.00:07:01
    Hashtables introduction - collisions
  115. Урок 115.00:06:04
    Hashtables introduction - load factor & dynamic resizing
  116. Урок 116.00:04:06
    Chaining method summary
  117. Урок 117.00:09:17
    Chaining implementation I - put
  118. Урок 118.00:04:29
    Chaining implementation II - get
  119. Урок 119.00:08:01
    Chaining implementation III - testing
  120. Урок 120.00:04:00
    Linear probing summary
  121. Урок 121.00:05:34
    Linear probing implementation I - put
  122. Урок 122.00:02:59
    Linear probing implementation II - get
  123. Урок 123.00:04:45
    Linear probing implementation III - testing
  124. Урок 124.00:06:46
    Generic linear probing implementation I - basics
  125. Урок 125.00:04:15
    Generic linear probing implementation II - get
  126. Урок 126.00:05:36
    Generic linear probing implementation III - put
  127. Урок 127.00:06:28
    Generic linear probing implementation IV - remove
  128. Урок 128.00:05:31
    Generic linear probing implementation V - resize
  129. Урок 129.00:02:40
    Generic linear probing implementation VI - testing
  130. Урок 130.00:02:06
    Generic linear probing implementation - hashCode
  131. Урок 131.00:05:53
    Maps in Java Collections
  132. Урок 132.00:06:32
    Practical (real-world) applications of hashing
  133. Урок 133.00:07:30
    Two sum problem solution
  134. Урок 134.00:03:27
    Why to use cache?
  135. Урок 135.00:08:07
    LRU cache introduction
  136. Урок 136.00:04:23
    LRU cache implementation I
  137. Урок 137.00:11:19
    LRU cache implementation II
  138. Урок 138.00:11:58
    Fenwick trees theory I - basics
  139. Урок 139.00:04:43
    Fenwick trees theory II - tree structure
  140. Урок 140.00:08:03
    Fenwick trees theory III - update
  141. Урок 141.00:05:12
    Fenwick trees implementation