LeetCode | 99. Recover Binary Search Tree

 

题目：

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?

 

代码：

/**
 * 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:
    TreeNode *first, *second, *prev;
    void backtrack(TreeNode* root) {
        if(root == NULL)
            return;
        backtrack(root->left);
        if(first == NULL && prev->val >= root->val) {
            first = prev;
        }
        if(first != NULL && prev->val >= root->val) {
            second = root;
        }
        prev = root;
        backtrack(root->right);
        return;
    }
    void recoverTree(TreeNode* root) {
        if(root == NULL)
            return;
        first = second = NULL;
        prev = new TreeNode(-9999999);
        backtrack(root);
        int tmp = first->val;
        first->val = second->val;
        second->val = tmp;
        return;
    }
};