一、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
转载请注明原文地址: https://mac.8miu.com/read-500175.html