leetcode第50题（recover-binary-search-tree）

题目：

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? 

confused what"{1,#,2,3}"means? > read more on how binary tree is serialized on OJ.

思路：

中序遍历找到发生错误的两个节点，并记录下节点，最后交换这两个节点的值即可。pre代表前序遍历的前一个节点，mistake1和mistake2是两个错误的节点。判断出错的依据是当前节点的值大于pre节点的值。

代码：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
        TreeNode pre,mistake1,mistake2;
    public void recoverTree(TreeNode root) {
        inTraversal(root);
        int temp=mistake1.val;
        mistake1.val = mistake2.val;
        mistake2.val = temp;
    }
    public void inTraversal(TreeNode root){
        if(root==null) return ;
        inTraversal(root.left);
        if(pre!=null&&pre.val>root.val){
            if(mistake1==null){
                mistake1=pre;
                mistake2=root;
            }else mistake2=root;
        }
        pre=root;
        inTraversal(root.right);
    }
}