LeetCode 99 Recover Binary Search Tree(Python详解及实现)

【题目】

Two elements of a binary search tree (BST)are swapped by mistake.

 

Recover the tree without changing itsstructure.

 

Note:

A solution using O(n) space is prettystraight forward. Could you devise a constant space solution?

一个二叉搜索树的两个元素被交换了，在不改变结构的情况下恢复树。空间复杂度O(n)

 

【思路】

最笨方法：

对于二叉查找树，其中序遍历是升序的，如果结点发生了交换，那么中序遍历不满足升序排列。中序遍历二叉树，并记录遍历节点值treeVal与二叉树结点指针treePointer，然后将treeVal一一赋值给treePointer。

 

【Python实现】

classTreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None
 
classSolution(object):
    def recoverTree(self, root):
        """
        :type root: TreeNode
        :rtype: void Do not return anything,modify root in-place instead.
        """
        treeVal = []
        treePointer = []
        self.inorder(root, treeVal,treePointer)
        treeVal.sort()
        for i in range(len(treeVal)):
            treePointer[i].val = treeVal[i]
        return root
 
    def inorder(self, root, treeVal,treePointer):#中序遍历
        if root:
            self.inorder(root.left, treeVal,treePointer)
            treeVal.append(root.val)
            treePointer.append(root)
            self.inorder(root.right, treeVal,treePointer)
       
           
if__name__ == '__main__':
    S = Solution()
    l1 = TreeNode(4)
    l2 = TreeNode(2)
    l3 = TreeNode(6)
    l4 = TreeNode(1)
    l5 = TreeNode(5)
    l6 = TreeNode(3)
    l7 = TreeNode(7)
      
    root = l1
   
    l1.left = l2
    l1.right = l3
   
    l2.left = l4
    l2.right = l5
    l3.left = l6
    l3.right = l7