Available question text
Replace each node's value with the sum of all nodes at the same depth that have different parents (its cousins) and return the modified tree. This is typically solved by level-order traversal computing level sums and excluding sibling groups to get each node's cousin sum in O(n) time and O(width) space (n up to 1e5).
Related questions
Continue with questions that share topics or the same question type.
- Cousins 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
- Average of Levels in Binary 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 2641. Cousins in Binary Tree II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source