LeetCode力扣之99. Recover Binary Search Tree

本文链接：https://blog.csdn.net/liwei1205/article/details/79556652

本文提供了一种在不改变二叉搜索树结构的情况下，解决两个节点值被错误交换的问题的方法。采用Morris遍历的方式，找出被交换的两个节点，并进行值的交换，最终达到修复的目的。介绍了如何通过O(1)空间复杂度来解决问题。

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

Recover the tree without changing its structure.

Note:

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

package leetCode;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/14.
 */
public class L099_RecoverBinarySearch {

    public void recoverTree(TreeNode root){

        TreeNode pre = null;
        TreeNode cur = root;

        TreeNode first = null;
        TreeNode second = null;
        TreeNode tmp = null;
        while (cur != null){
            if (cur.left != null){

                tmp = cur.left;
                while (tmp.right != null && tmp.right != cur){
                    tmp = tmp.right;
                }

                if (tmp.right == null){
                    tmp.right = cur;
                    cur = cur.left;
                } else {
                    if (pre != null && pre.val > cur.val){
                        if (first == null){
                            first = pre;
                            second = cur;
                        } else {
                            second = cur;
                        }
                    }

                    pre = cur;
                    tmp.right = null;
                    cur = cur.right;
                }
            } else {
                if (pre != null && pre.val > cur.val){
                    if (first == null){
                        first = pre;
                        second = cur;
                    } else {
                        second = cur;
                    }
                }
                pre = cur;
                cur = cur.right;
            }
        }

        if (first != null && second != null){
            first.val ^= second.val;
            second.val ^= first.val;
            first.val ^= second.val;
        }
    }
}