leetcode 7题树的题目 python

99 恢复二叉树
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def __init__(self):
        self.k = 0
        self.array = []
    def k_node(self, root: TreeNode) -> TreeNode:
        if not root:
            return None
        left = self.k_node(root.left)
        if left:
            return left
        if self.k == 0:
            return root
        self.k -= 1
        right = self.k_node(root.right)
        if right:
            return right
        
    def inorder(self, root):
        if not root:
            return
        self.inorder(root.left)
        self.array.append(root.val)
        self.inorder(root.right)

    def recoverTree(self, root: TreeNode) -> None:
        """
        Do not return anything, modify root in-place instead.
        """
        self.inorder(root)
        k1 = -1
        k2 = 1
        for i in range(len(self.array)):
            if i == 0 and self.array[i] > self.array