LeetCode99. Recover Binary Search Tree（C++）

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

Recover the tree without changing its structure.

Example 1:

Input: [1,3,null,null,2]

   1
  /
 3
  \
   2

Output: [3,1,null,null,2]

   3
  /
 1
  \
   2

Example 2:

Input: [3,1,4,null,null,2]

  3
 / \
1   4
   /
  2

Output: [2,1,4,null,null,3]

  2
 / \
1   4
   /
  3

Follow up:

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

解题思路：BST的中序遍历为有序数组，所以先遍历得所有的节点值，在中序遍历重新赋相应的节点值

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int>value;
    int cnt = 0;
    void recoverTree(TreeNode* root) {
        pretravel(root);
        sort(value.begin(),value.end());
        intravel(root);
    }
    void pretravel(TreeNode *root){
        if(root == NULL)
            return;
        value.push_back(root->val);
        pretravel(root->left);
        pretravel(root->right);
    }
    void intravel(TreeNode *root){
        if(root == NULL)
            return;
        intravel(root->left);
        root->val = value[cnt ++];
        intravel(root->right);
    }
};