Available question text
A binary tree has exactly one child pointer that incorrectly points to another existing node, creating a node with two parents (or a cycle); locate and remove that wrong pointer to restore a valid tree. Solve by traversing the structure (BFS/DFS) while tracking seen nodes to detect the offending edge and set it to null.
Related questions
Continue with questions that share topics or the same question type.
- 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
- Average of Levels in Binary Tree
Coding
- 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 1660. Correct a Binary Tree
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source