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 lists of integers,
with the ith list containing the values of nodes on level i,
from left to right.
For example:
Try it yourself
Title
Script
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.
Contrary to popular belief, Lorem Ipsum is not simply random text.
>>> a = [1, 2, 3]
>>> a[-1]
3