Binary Tree Level Order Traversal
Prereq: BFS on Tree
Given a binary tree, return its level order traversal. Input is the root node of the tree. The output should be a list of tree nodes.
Try it yourself
Loading full content...
Prereq: BFS on Tree
Given a binary tree, return its level order traversal. Input is the root node of the tree. The output should be a list of tree nodes.