一、563. 二叉树的坡度

1.1、题目描述

1.2.1、递归

class Solution: def __init__(self) -> None: self.tilt = 0 def findTilt(self, root: TreeNode) -> int: self.traverse(root) return self.tilt def traverse(self, root: TreeNode) -> int: if not root: return 0 left = self.traverse(root.left) right = self.traverse(root.right) # 左右子树的节点之差 self.tilt += abs(left - right) # 记录该节点数的和 return left + right + root.val