1. Урок 1. 00:04:17
    What Are Data Structures and Why Are They Important?
  2. Урок 2. 00:09:48
    Constructor Functions and the "this" Keyword
  3. Урок 3. 00:05:57
    The Prototype Object
  4. Урок 4. 00:02:36
    What is a Linked List?
  5. Урок 5. 00:06:36
    Linked List and "Node" Constructor Functions
  6. Урок 6. 00:03:20
    Add To Head - part 1
  7. Урок 7. 00:06:57
    Add To Head - part 2
  8. Урок 8. 00:05:07
    Using Add To Head
  9. Урок 9. 00:02:50
    Add To Tail
  10. Урок 10. 00:04:18
    Testing Add To Tail and Add To Head
  11. Урок 11. 00:05:22
    Remove Head
  12. Урок 12. 00:04:06
    Remove Tail
  13. Урок 13. 00:06:30
    Search Method
  14. Урок 14. 00:02:51
    Testing Search
  15. Урок 15. 00:01:11
    Linked List - Independent Exercise
  16. Урок 16. 00:05:11
    Linked List - Exercise Review
  17. Урок 17. 00:08:56
    Big O Notation and Calculating the Runtime of a Function
  18. Урок 18. 00:04:29
    Linked List Wrap-Up
  19. Урок 19. 00:05:52
    What is a Binary Search Tree?
  20. Урок 20. 00:04:21
    Recursion - part 1
  21. Урок 21. 00:05:20
    Recursion part 2 and the Call Stack
  22. Урок 22. 00:08:09
    Insert Method
  23. Урок 23. 00:03:03
    Testing Insert
  24. Урок 24. 00:03:54
    Contains Method
  25. Урок 25. 00:02:05
    Testing Contains
  26. Урок 26. 00:07:15
    Depth First Traversal - In-Order
  27. Урок 27. 00:01:54
    Testing Depth First Traversal In-Order
  28. Урок 28. 00:02:34
    Refactoring Depth First Traversal Method
  29. Урок 29. 00:02:47
    Depth First Traversal - Pre-Order
  30. Урок 30. 00:01:24
    Testing Depth First Traversal Pre-Order
  31. Урок 31. 00:03:40
    Depth First Traversal - Post-Order
  32. Урок 32. 00:03:38
    Breadth First Traversal - part 1
  33. Урок 33. 00:06:16
    Breadth First Traversal - part 2
  34. Урок 34. 00:02:35
    Testing Breadth First Traversal
  35. Урок 35. 00:00:50
    Binary Search Tree - Independent Exercise
  36. Урок 36. 00:03:09
    Binary Search Tree - Exercise Review
  37. Урок 37. 00:03:27
    Binary Search Tree Wrap-up
  38. Урок 38. 00:06:45
    What is a Hash Table?
  39. Урок 39. 00:04:46
    Hash Table and Hash Node Constructor Functions
  40. Урок 40. 00:04:21
    CharCodeAt Method and Modulus Operator
  41. Урок 41. 00:04:47
    Hash Method
  42. Урок 42. 00:05:35
    Insert Method
  43. Урок 43. 00:03:21
    Testing Insert Method
  44. Урок 44. 00:05:47
    Refactoring Insert Method
  45. Урок 45. 00:02:25
    Testing Refactored Insert Method
  46. Урок 46. 00:04:55
    Get Method
  47. Урок 47. 00:01:45
    Testing Get Method
  48. Урок 48. 00:00:50
    Hash Table - Independent Exercise
  49. Урок 49. 00:04:57
    Hash Table - Exercise Review
  50. Урок 50. 00:02:07
    Hash Table Wrap-up
  51. Урок 51. 00:01:27
    Next Steps