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?

中序遍历之后就变成了数组中查错的问题，但是中序遍历的空间复杂度是O(log(n))，所以就需要一个空间复杂度为O(1)的中序遍历的方法，神马moris。。。有空再看吧

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    TreeNode *p;
    TreeNode *q;
    
    TreeNode *last;
    TreeNode *cur;
    
public:
    void inorder(TreeNode *root){
        if(!root) return;
        
        if(root -> left) inorder(root -> left);
        if(!last){
            last = root;
        }else{
            cur = root;
            if(cur -> val <= last -> val){
                //something wrong probabily happens
                if(!p && !q){
                    p = last;
                    q = cur;
                }else{
                    q = cur;
                }
                
            }
            last = cur;
        }
         
        if(root -> right) inorder(root -> right);
        
    }

    void recoverTree(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        p = NULL;
        q = NULL;
        
        last = NULL;
        cur = NULL;
        
        inorder(root);
        int tmp = p->val;
        p->val = q->val;
        q->val = tmp;
        
        
    }
};