Available question text
Compute the sum of every node's tilt in a binary tree, where a node's tilt is the absolute difference between the sum of values in its left and right subtrees. This is solved by a post-order traversal that returns subtree sums and accumulates each node's absolute difference (one-pass O(n) solution).
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
Microsoft
Leetcode 563. Binary Tree Tilt
Reported Aug 19, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source