Computer Science Fundamentals
Beginner
Binary Trees & Graphs
A comprehensive, beginner-friendly guide to learning Binary Trees & Graphs. Master the fundamentals and build real-world projects.
30 chapters
4h 23m
4.7
(241)
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 Introduction to Trees and Graphs 5 min
- 2 Tree Terminology and Fundamentals 5 min
- 3 Binary Trees Basics 6 min
- 4 Binary Tree Representation 7 min
- 5 Binary Tree Traversal Algorithms 8 min
- 6 Depth First Search (DFS) in Trees 9 min
- 7 Breadth First Search (BFS) in Trees 9 min
- 8 Binary Search Trees (BST) 5 min
- 9 BST Insertion and Deletion 10 min
- 10 Balanced Binary Trees 9 min
- 11 AVL Trees 10 min
- 12 Red-Black Trees 9 min
- 13 Heap Data Structures 9 min
- 14 Min Heap and Max Heap 10 min
- 15 Heap Sort Algorithm 10 min
- 16 Trie Data Structure 10 min
- 17 Segment Trees 9 min
- 18 Introduction to Graph Theory 9 min
- 19 Graph Representation Techniques 5 min
- 20 Graph Traversal Algorithms 10 min
- 21 Breadth First Search (BFS) for Graphs 10 min
- 22 Depth First Search (DFS) for Graphs 10 min
- 23 Shortest Path Algorithms 9 min
- 24 Dijkstraβs Algorithm 10 min
- 25 Minimum Spanning Trees 10 min
- 26 Topological Sorting 10 min
- 27 Disjoint Set Union (Union-Find) 11 min
- 28 Advanced Graph Algorithms 10 min
- 29 Interview Preparation and Coding Challenges 10 min
- 30 Real-World Projects Using Trees and Graphs 9 min