深度优先搜索——恢复二叉搜索树

 注意：错位的两个不一定是紧挨着的，所以要交换的是最早的错位一个 和 最晚的错位的一个，即要遍历完所有的结点，找到这两个错位的结点。

用到中序遍历

栈：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public void recoverTree(TreeNode root) {
        Deque<TreeNode> stack=new LinkedList<TreeNode>();
        TreeNode pre=null;
        TreeNode x=null,y=null;//x保存最开始的错位的pre,y保存最后的错位的root
        while(root!=null||!stack.isEmpty()){
            while(root!=null){
                stack.push(root);
                root=root.left;
            }
            root=stack.pop();
            if(pre!=null&&root.val<pre.val){
                y=root;
                if(x==null) x=pre;
            }
            pre=root;
            root=root.right;
        }
        int temp=x.val;
        x.val=y.val;
        y.val=temp;
        return;
    }
}

 

Morris:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public void recoverTree(TreeNode root) {
        TreeNode pre=null;
        TreeNode predecessor=null,x=null,y=null;
        while(root!=null){
            if(root.left==null){
                if(pre!=null&&root.val<pre.val){
                   y=root;
                   if(x==null) x=pre;
                }
                   pre=root;
                   root=root.right;
            }
            else{
                predecessor=root.left;
                while(predecessor.right!=null&&predecessor.right!=root){
                    predecessor=predecessor.right;
                }
                if(predecessor.right==null){
                    predecessor.right=root;
                    root=root.left;
                }
                else{
                    if(pre!=null&&root.val<pre.val){
                         y=root;
                         if(x==null) x=pre;
                    }
                    predecessor.right=null;
                    pre=root;
                    root=root.right;
                }
            }
        }
        int temp=x.val;
        x.val=y.val;
        y.val=temp;
        return;
    }
}