给定一个二叉搜索树(左节点值<根节点值<右节点值),输出:左=左+根+右,根=根+右,右=右。
从右子树至左子树进行相加,返回left(相加最大值),“temp”用来记录需要相加的数值。
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def convertBST(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
self.help(root, 0)
return root
def help(self, root, temp):
if not root:
return temp
right = self.help(root.right, temp)
temp = root.val = root.val+right
left = self.help(root.left, temp)
return left