Graph

Summary

A structure of nodes connected by edges, modeling relationships and networks — traversed via BFS/DFS, one of the richest problem categories in interviews.

How to Learn This

1Implement graph representations: adjacency list and adjacency matrix.
2Solve classic problems: number of islands, course schedule (cycle detection), shortest path.
3Practice both BFS and DFS traversal, and know when each is the better fit.

Tree

Binary Search

More topics in Data Structures & Algorithms

Arrays Strings Linked List Stack Queue HashMap Heap Tree Binary Search Recursion Backtracking Sliding Window Greedy Dynamic Programming Sorting Searching

Stuck on this topic? Ask an Insider

Get 1:1 guidance from people who've walked this exact path — free on the InsideEdge app.

Download