Available question text
Given a perfect binary tree, reverse the node values at every odd-numbered level (1, 3, 5, ...) so that the sequence of values on each odd level is reversed, and return the modified tree. The perfect-tree property lets you pair symmetric nodes across each level and swap their values in-place.
Related questions
Continue with questions that share topics or the same question type.
- Average of Levels in Binary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Balance a Binary Search Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2415. Reverse Odd Levels of Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source