404. 左叶子之和
题目描述
解题思路
1、树遍历,左叶子特点是左子树并且没有自身没有左右子树
代码实现
class Solution:
def sumOfLeftLeaves(self, root: TreeNode) -> int:
self.res = 0
def post_order(root):
# 后序
if not root:
return None
left = post_order(root.left)
right = post_order(root.right)
if left and not left.left and not left.right:
self.res += left.val
return root
# sum_left_leaves(root)
def pre_order(root):
# 前序
if not root:
return
if root.left and root.left.left is None and root.left.right is None:
self.res += root.left.val
pre_order(root.left)
pre_order(root.right)
pre_order(root)
return self.res