1. Урок 1. 00:01:26
    About this course
  2. Урок 2. 00:07:13
    Introduction
  3. Урок 3. 00:07:12
    Rotations
  4. Урок 4. 00:10:43
    Insertion in AVL Tree - 1
  5. Урок 5. 00:09:08
    Insertion in AVL Tree - 2
  6. Урок 6. 00:14:13
    Insertion in AVL Tree - 3
  7. Урок 7. 00:04:39
    Insertion in AVL Tree - 4
  8. Урок 8. 00:07:06
    Examples of insertion in AVL Tree
  9. Урок 9. 00:05:16
    Deletion in AVL Tree - 1
  10. Урок 10. 00:10:36
    Deletion in AVL Tree - 2
  11. Урок 11. 00:05:56
    Deletion in AVL Tree - 3
  12. Урок 12. 00:07:38
    Examples of deletion in AVL Tree
  13. Урок 13. 00:12:31
    Introduction
  14. Урок 14. 00:05:12
    Insertion
  15. Урок 15. 00:07:38
    Deletion
  16. Урок 16. 00:03:27
    Introduction
  17. Урок 17. 00:05:49
    Constructing and Evaluating an Expression Tree
  18. Урок 18. 00:04:40
    Implementation of Expression Tree
  19. Урок 19. 00:11:25
    Introduction
  20. Урок 20. 00:05:42
    Inorder Traversal
  21. Урок 21. 00:08:57
    Searching
  22. Урок 22. 00:14:21
    Insertion
  23. Урок 23. 00:18:32
    Implementation of Insertion - 1
  24. Урок 24. 00:07:02
    Implementation of Insertion - 2
  25. Урок 25. 00:03:47
    Deletion
  26. Урок 26. 00:09:31
    Examples of Deletion from Leaf Node
  27. Урок 27. 00:03:31
    Examples of Deletion from Non-Leaf Node
  28. Урок 28. 00:12:38
    Implementation of Deletion
  29. Урок 29. 00:03:25
    Introduction
  30. Урок 30. 00:09:09
    Terminology
  31. Урок 31. 00:03:13
    Cycles
  32. Урок 32. 00:05:50
    Connectivity in Undirected Graph
  33. Урок 33. 00:03:23
    Connectivity in Directed Graphs
  34. Урок 34. 00:03:17
    Tree and Forest
  35. Урок 35. 00:05:36
    Representation of Graph Adjacency Matrix
  36. Урок 36. 00:13:02
    Adjacency Matrix in C
  37. Урок 37. 00:05:51
    Representation of Graph Adjacency List
  38. Урок 38. 00:10:44
    Adjacency List in C
  39. Урок 39. 00:09:50
    Transitive closure of a directed graph and Path Matrix
  40. Урок 40. 00:10:18
    Warshalls Algorithm
  41. Урок 41. 00:02:00
    Warshalls Algorithm in C
  42. Урок 42. 00:02:42
    Introduction
  43. Урок 43. 00:05:05
    Breadth First Search
  44. Урок 44. 00:06:56
    Implementation of Breadth First Search
  45. Урок 45. 00:07:55
    Finding Shortest path in an unweighted graph
  46. Урок 46. 00:02:39
    BFS Spanning Tree
  47. Урок 47. 00:07:09
    BFS in Undirected Graphs Finding Connected Components
  48. Урок 48. 00:03:41
    Depth First Search
  49. Урок 49. 00:07:00
    Implementation of Depth First Search through Stack
  50. Урок 50. 00:05:59
    Recursive Implementation of Depth First Search
  51. Урок 51. 00:07:00
    Classification of Edges in DFS of Directed Graph
  52. Урок 52. 00:04:47
    Classification of Edges in DFS of Undirected Graph
  53. Урок 53. 00:02:25
    Shortest Path Problem
  54. Урок 54. 00:09:04
    Dijkstras Algorithm
  55. Урок 55. 00:08:29
    Dijkstras Algorithm Example
  56. Урок 56. 00:04:35
    Dijkstras Algorithm in C
  57. Урок 57. 00:01:31
    Introduction
  58. Урок 58. 00:03:38
    Prims Algorithm
  59. Урок 59. 00:06:10
    Prims Algorithm Example
  60. Урок 60. 00:03:54
    Prims Algorithm in C
  61. Урок 61. 00:02:33
    Kruskals Algorithm
  62. Урок 62. 00:03:48
    Kruskals Algorithm Example
  63. Урок 63. 00:10:29
    Implementation of Kruskals Algorithm
  64. Урок 64. 00:04:21
    Kruskals Algorithm in C