Leetcode 538. 把二叉搜索树转换为累加树 Convert BST to Greater Tree - Python 递归法 二叉树部分总结

思路：

1. 可以讲此题看为有序数组去理解：将数组从后往前不断累加；

2. 又因为这是一棵平衡二叉树所以是有序的，若想从后向前由大到小累加，则需要逆中序遍历（右中左，普通后续遍历是：左中右）；

3. 需要pre全局变量，来记录之前元素之和；需要cur局部变量指向当前遍历元素；

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def convertBST(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        self.pre = 0
        self.traversal(root)
        return root

    
    def traversal(self, cur: Optional[TreeNode]):
        if not cur: return

        self.traversal(cur.right)
        cur.val += self.pre
        self.pre = cur.val
        self.traversal(cur.left)
    

引用：

https://github.com/youngyangyang04/leetcode-master/blob/master/problems/0538.%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%B4%AF%E5%8A%A0%E6%A0%91.md

二叉树知识点总结：

https://github.com/youngyangyang04/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E6%80%BB%E7%BB%93%E7%AF%87.md

二叉树知识点思维导图：

https://camo.githubusercontent.com/371775ff774c79c66cfe5437e63e116afe43be8b2d6f66ab4a264f68e628fce4/68747470733a2f2f636f64652d7468696e6b696e672d313235333835353039332e66696c652e6d7971636c6f75642e636f6d2f706963732f32303231313033303132353432312e706e67