7 docs tagged with "breadth-first-search"

Given a binary tree, return its column order traversal from top to bottom and left to right. Note: if two nodes are in the same row and column, order them from left to right.

Given a binary tree, return all the values you'd be able to see if you were standing on the left side of it with values ordered from top to bottom.

Given a binary tree, return its level order traversal where the nodes in each level are ordered from left to right.

Given a binary tree, return its level order traversal where the nodes in each level are ordered from left to right, and the levels are ordered from bottom to top.

Given a binary tree, return its zigzag level order traversal. (i.e., from left to right, then right to left for the next level and alternate between).

Given a binary tree, return the largest value in each of its levels.

Given an n-ary tree, return its level order traversal.