Data Structures in JavaScript: Trees and Graphs

Course details

Trees and graphs are core data structures in computer science, and understanding them is key to leveling up as an engineer. In this course, build a strong foundational understanding of these structures in JavaScript through clear explanations, real-world patterns, and hands-on coding practice. Instructor David Chen guides you step-by-step through essential concepts, including tree and graph implementation, traversal algorithms, and algorithm efficiency. With thoughtfully designed examples and problem sets that build in complexity, learn how to approach, solve, and optimize classic problems with confidence. Whether you’re preparing for interviews or sharpening your problem-solving skills, this course will help you think more clearly and code more effectively.

Learning objectives
Understand the different types of trees and graphs and their properties.
Implement and debug trees and graphs in JavaScript and traverse them through DFS and BFS.
Analyze the time and space complexity and evaluate the efficiency of your trees and graph algorithms.

Concepts

0. Introduction

01 - Trees and graphs in JavaScript
02 - Exploring the lab content - CoderPad
03 - What you should know

1. Introduction to Trees

04 - Nodes, edges, and trees
05 - What is a binary tree
06 - Code a binary tree
07 - In-order, pre-order, post-order traversal

2. Depth-First Search (DFS) and Breadth-First Search (BFS) on Binary Trees

08 - Depth-first search concept
09 - Depth-first search implementation
10 - Breadth-first search concept
11 - Breadth-first search implementation
12 - Solution - Find the height of a binary tree
13 - Solution - Zig-zag traversal

3. Binary Search Trees

14 - Binary search tree concept
15 - Binary search tree implementation - insert
16 - Binary search tree implementation - search
17 - Binary search tree implementation - delete
18 - Solution - Validate a binary tree as BST
19 - Solution - Find the Kth smallest element in BST

4. Graphs

20 - What is a graph
21 - Graph types
22 - Graph representations in JavaScript

5. Depth-First Search (DFS) and Breadth-First Search (BFS) on Graphs

23 - Depth-first search concept
24 - Depth-first search implementation
25 - Breadth-first search concept
26 - Breadth-first search implementation
27 - Complexity analysis of DFS and BFS
28 - Solution - Number of islands
29 - Solution - Clone graph

6. Topological Sort

30 - Topological sort concept
31 - Topological sort implementation
32 - Solution - Course scheduling
33 - Cycle-detection concept
34 - Cycle-detection implementation
35 - Solution - Unreliable course scheduling

Conclusion

36 - Next steps