2 docs tagged with "BFS"

Given the root of a binary tree, return the values of its nodes level by level, from left to right.

Given a connected undirected graph represented by a reference to one of its nodes, create a deep copy of the entire graph.