Back to course home

0% completed

# Solution: Level Order Successor

## Problem Statement

Given a binary tree and a node, find the level order successor of the given node in the tree. The level order successor is the node that appears right after the given node in the level order traversal.

**Example 1**:

**Example 2**:

**Example 3**:

**Constraints:**

- The number of nodes in the tree is in the range [0, 10<sup>5</sup>].
`-1000 <= Node.val <= 1000`

## Solution

This problem follows the **Binary Tree Level Order Traversal** pattern. We can follow the same **BFS** approach. The only difference will be that we will not keep track of all the levels

.....

.....

.....

Like the course? Get enrolled and start learning!