Skip to main content
Computer Science Fundamentals Beginner

Binary Trees & Graphs

Hierarchical and connected data in depth: binary trees and BSTs, self-balancing AVL and red-black trees, heaps, tries and segment trees, then graph representation with BFS, DFS, shortest-path and minimum-spanning-tree algorithms.

30 chapters 4h 23m
Start Learning

What you'll learn

  • Introduction to Trees and Graphs
  • Tree Terminology and Fundamentals
  • Binary Trees Basics
  • Binary Tree Representation
  • Binary Tree Traversal Algorithms
  • Depth First Search (DFS) in Trees
  • Breadth First Search (BFS) in Trees
  • Binary Search Trees (BST)

Course content

30 chapters · 4h 23m
  1. 1 Introduction to Trees and Graphs 5 min
  2. 2 Tree Terminology and Fundamentals 5 min
  3. 3 Binary Trees Basics 6 min
  4. 4 Binary Tree Representation 7 min
  5. 5 Binary Tree Traversal Algorithms 8 min
  6. 6 Depth First Search (DFS) in Trees 9 min
  7. 7 Breadth First Search (BFS) in Trees 9 min
  8. 8 Binary Search Trees (BST) 5 min
  9. 9 BST Insertion and Deletion 10 min
  10. 10 Balanced Binary Trees 9 min
  11. 11 AVL Trees 10 min
  12. 12 Red-Black Trees 9 min
  13. 13 Heap Data Structures 9 min
  14. 14 Min Heap and Max Heap 10 min
  15. 15 Heap Sort Algorithm 10 min
  16. 16 Trie Data Structure 10 min
  17. 17 Segment Trees 9 min
  18. 18 Introduction to Graph Theory 9 min
  19. 19 Graph Representation Techniques 5 min
  20. 20 Graph Traversal Algorithms 10 min
  21. 21 Breadth First Search (BFS) for Graphs 10 min
  22. 22 Depth First Search (DFS) for Graphs 10 min
  23. 23 Shortest Path Algorithms 9 min
  24. 24 Dijkstra’s Algorithm 10 min
  25. 25 Minimum Spanning Trees 10 min
  26. 26 Topological Sorting 10 min
  27. 27 Disjoint Set Union (Union-Find) 11 min
  28. 28 Advanced Graph Algorithms 10 min
  29. 29 Interview Preparation and Coding Challenges 10 min
  30. 30 Real-World Projects Using Trees and Graphs 9 min