BFS - Michael's Blog

BFS

A collection of 4 posts

Graph Valid Tree

261. Graph Valid Tree [https://leetcode.com/problems/graph-valid-tree] Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree. For example: Given n = 5

Binary Tree Level Order Traversal

102. Binary Tree Level Order Traversal [https://leetcode.com/problems/binary-tree-level-order-traversal/] LintCode-69.Binary Tree Level Order Traversal [http://www.lintcode.com/en/problem/binary-tree-level-order-traversal] Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree

Number of Connected Components in an Undirected Graph

323. Number of Connected Components in an Undirected Graph [https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/] Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected

Find the Connected Component in the Undirected Graph

LintCode-431.Find the Connected Component in the Undirected Graph [http://www.lintcode.com/en/problem/find-the-connected-component-in-the-undirected-graph/] > Find the number connected component in the undirected graph. Each node in the graph contains a label and a list of its neighbors. (a connected component (or just component) of an undirected graph is