Queue

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: BFS Tree

Complexity Range

Time Complexity


                  O(n)

(1 problem)

Space Complexity


                  O(n)

(1 problem)

Problems Using Queue

Binary Tree Level Order Traversal

Return the level order traversal of a binary tree.

Medium LeetCode

Example: [3,9,20,null,null,15,7] → [[3],[9,20],[15,7]]

View Solution →

← Back to All Patterns

View All Categories