4 docs tagged with "BFS"

Learn graph representations (adjacency list and matrix), graph traversal algorithms (BFS and DFS), and connected components analysis.

Master graph algorithms and data structures. Learn graph traversal, shortest path algorithms, and advanced graph problems.

Explore practical queue applications including BFS traversal, task scheduling, and sliding window maximum with deques for efficient problem-solving.

Master tree data structures including traversals (inorder, preorder, postorder, level-order), height calculations, and properties.