One doc tagged with "Breadth-first Search"

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).