LeetCode 102. Binary Tree Level Order Traversal



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

For example:
Given binary tree [3,9,20,null,null,15,7],

return its level order traversal as:


Conduct a breadth-first search for level order traversal. Uses a queue to help store the level nodes.

Video Tutorial

Java Solution

Leave a Reply

Your email address will not be published. Required fields are marked *