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.

OJ’s Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where ‘#’ signifies a path terminator where no node exists below.
Here’s an example:
1
/ \
2 3
/
4
\
5
The above binary tree is serialized as”{1,2,3,#,#,4,#,#,5}”.

程序：

方法一：

class Solution {
public:
void Inorder(TreeNode *root,vector<int> &vec,vector<TreeNode *> &node)
{
    if(!root)
       return;
    Inorder(root->left,vec,node);
    vec.push_back(root->val);
    node.push_back(root);
    Inorder(root->right,vec,node);
}
void recoverTree(TreeNode *root)
{
    vector<int> vec;
    vector<TreeNode *> node;
    Inorder(root,vec,node);
    sort(vec.begin(),vec.end());
    for(int i=0;i<vec.size();i++)
        node[i]->val = vec[i];
}
};

方法二：

class Solution {
public:
    TreeNode *pre,*a,*b;
    void recoverTree(TreeNode *root) {
         pre=a=b=NULL;
         dfs(root);
         if(a&&b) swap(a->val,b->val);
    }
    void dfs(TreeNode *root){
         if(!root) return;
         dfs(root->left);
         if(pre&&pre->val>root->val){
              if(!a) a=pre;
              b=root;
         }
         pre=root;
         dfs(root->right);
    }
};

点评：

中序遍历的应用