Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Visualizer › Trees

Level Order Traversal (BFS)

Visits the tree level by level, left to right, using a queue — breadth-first search on a tree.

How it works

Complexity

Code (Python)

from collections import deque

def level_order(root):
    out, q = [], deque([root] if root else [])
    while q:
        node = q.popleft()
        out.append(node.val)
        if node.left:  q.append(node.left)
        if node.right: q.append(node.right)
    return out

Practise: Trees problems