# BFS

- [1. BFS in Binary Tree](/algo/bfs/1.-bfs-in-binary-tree.md)
- [Check Full Binary Tree](/algo/bfs/1.-bfs-in-binary-tree/check-full-binary-tree.md): ID: 726; medium
- [Binary Tree Level Order Traversal II](/algo/bfs/1.-bfs-in-binary-tree/binary-tree-level-order-traversal-ii.md): ID: 70; medium
- [Binary Tree Maximum Path Sum II](/algo/bfs/1.-bfs-in-binary-tree/binary-tree-maximum-path-sum-ii.md): ID: 475; medium
- [Convert Binary Tree to Linked Lists by Depth](/algo/bfs/1.-bfs-in-binary-tree/convert-binary-tree-to-linked-lists-by-depth.md): ID: 242; easy
- [2. Connected Graph & Topologic Sorting](/algo/bfs/2.-connected-graph-and-topologic-sorting.md)
- [Search Graph Nodes](/algo/bfs/2.-connected-graph-and-topologic-sorting/search-graph-nodes.md): ID: 618; medium
- [Graph Valid Tree](/algo/bfs/2.-connected-graph-and-topologic-sorting/graph-valid-tree.md): ID: 178; medium
- [Connected Component in Undirected Graph](/algo/bfs/2.-connected-graph-and-topologic-sorting/connected-component-in-undirected-graph.md): ID: 431; medium
- [Topological Sorting](/algo/bfs/2.-connected-graph-and-topologic-sorting/topological-sorting.md): ID: 127; medium
- [Course Schedule](/algo/bfs/2.-connected-graph-and-topologic-sorting/course-schedule.md): ID: 615; medium
- [Course Schedule II](/algo/bfs/2.-connected-graph-and-topologic-sorting/course-schedule-ii.md): ID: 616; medium
- [Sequence Reconstruction](/algo/bfs/2.-connected-graph-and-topologic-sorting/sequence-reconstruction.md): ID: 605; medium
- [Clone Graph](/algo/bfs/2.-connected-graph-and-topologic-sorting/clone-graph.md): ID: 137; medium
- [Alien Dictionary](/algo/bfs/2.-connected-graph-and-topologic-sorting/alien-dictionary.md): ID: 892; hard