Limited Time Offer:Up to 25% off Hello Interview Premium

Back to Main

Your Dashboard

Learn Code

Introduction

Two Pointers

Overview

Container With Most Water

Two Sum (Sorted Array)

3-Sum

Triangle Numbers

Move Zeroes

Sort Colors

Trapping Rain Water

Sliding Window

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Intervals

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Stack

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Overview

Daily Temperatures

Largest Rectangle in Histogram

Linked List

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Binary Search

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Heap

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Breadth-First Search

Introduction

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Backtracking

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Graphs

Overview

Course Schedule

Course Schedule II

Dynamic Programming

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Greedy Algorithms

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Trie

Overview

Implement Trie Methods

Prefix Matching

Prefix Sum

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Matrices

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Tutor

Get Premium

Depth-First Search

Calculate Tilt

easy

DESCRIPTION (credit Leetcode.com)

Given the root node of a binary tree, write a recursive function to return the sum of all node tilts in the tree.

The tilt of a node is calculated as the absolute difference between the sum of all values in its left subtree and the sum of all values in its right subtree. For nodes that are missing a left child, right child, or both, treat the missing subtree as having a sum of 0.

For example, a leaf node has a tilt of 0 because both its left and right subtrees are empty (sum = 0), so the absolute difference is |0 - 0| = 0.

Example 1:

Input:

[5, 1, 3]

Output:

The leaf nodes 1, 3 have tilts of 0 (their left and right subtrees are empty)

The root node 5 has a tilt of |1 - 3| = 2

Example 2:

Input:

[4, 2, 7, 1, 3, 6, 9]

Output:

The leaf nodes 1, 3, 6, 9 have tilts of 0 (their left and right subtrees are empty)

Node 2 has a tilt of |1 - 3| = 2

Node 7 has a tilt of |6 - 9| = 3

Node 4 has a tilt of |6 - 22] = 16

2 + 3 + 16 = 21

Explanation

We can solve this problem using the framework established in the Overview section.

Return Values

If I'm at a node in the tree, what values do I need to calculate the tilt of the subtree rooted at that node?

The sum of the values in the left subtree.
The sum of the values in the right subtree.

This tells me that each recursive call should return the sum of the values in the subtree rooted at the current node. So in the body of the recursive function, I'll make recursive calls to the current node's left and right children, and then add the value of the current node to return the sum of the current subtree.

Before returning the sum of the current subtree, I'll also need to calculate the tilt of the current subtree. I can calculate the tilt of the current subtree as abs(left - right), and add that a global variable tilt that stores the total tilt of the tree. (see the Global Variables section for more details on why this is necessary).

Solution


# get the sum of current node's left and right subtrees
left = dfs(node.left)
right = dfs(node.right)
# calculate tilt of current subtree and add it to the global tilt variable
tilt += abs(left - right)
# return the sum of the current subtree
return left + right + node.val

Base Case

The tilt of an empty tree is 0.

Global Variables Note that the problem is asking for the total tilt of the tree, but each recursive call returns the sum of the nodes in the subtree rooted at a given node. Since these two values are different, we can use a global variable tilt to store the total tilt of the tree. This allows us to avoid using multiple return values in our recursive function, or having to pass the total tilt value from the parent to the child.

Helper Function

We don't need to pass values from the parent to the child to solve this problem. However, since we are using a global variable to store the total tilt of the tree, we should define tilt inside the body of our main function, and then introduce a helper function to perform the recursive calls. This way, no code outside of the main function will have access to the tilt variable.

Inside the main function, we can initiate the call to the helper function, passing in the root of the tree as an argument. We return the value of tilt after the recursive helper function has finished executing.

Solution

class Solution:
    def findTilt(self, root: TreeNode) -> int:
        tilt = 0
       # define a helper function to perform the recursive calls 
       # this ensures that the tilt variable is not accessible outside of the main function
        def dfs(node):
            nonlocal tilt
            # base case
            if not node:
                return 0
            # get the sum of the current node's left and right subtrees
            left = dfs(node.left)
            right = dfs(node.right)
            # calculate tilt of current subtree, and add it to the global tilt variable
            tilt += abs(left - right)
            # return the sum of the current subtree
            return left + right + node.val
       # initiate the call to the helper function 
        dfs(root)
        return tilt

Test Your Knowledge

Complexity Analysis

Time Complexity: O(N) where N is the number of nodes in the tree. We visit each node exactly once, and at each node, we perform constant time work.

Space Complexity: O(N) where N is the number of nodes. A total of N call frames have to be allocated, one for each node in the tree.

Mark as read

Next: Diameter of a Binary Tree

Your account is free and you can post anonymously if you choose.

The best mocks on the market.

Now up to 15% off

Learn More

Reading Progress

On This Page

Depth-First Search

Depth-First Search

Calculate Tilt

DESCRIPTION (credit Leetcode.com)

Explanation

Solution

Test Your Knowledge

Complexity Analysis

The best mocks on the market.

Questions

Learn

Links

Legal

Contact