链接:http://leetcode.com/onlinejudge#question_99
原题:
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?
思路:中序遍历整棵二叉树,如果当前元素的值小于前一个结点的值,
并且这是第一次出现逆序,那么前一个和当前结点都有可能是被交换
的结点,所以记录first = pre, second = root。当第二次出现逆序情况时候,
只要更新second = root就可以了。
代码:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void recoverTree(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!root || (!root->left && !root->right))
return;
TreeNode *pre, *first, *second;
pre = first = second = NULL;
search(root, pre, first, second);
int temp = first->val;
first->val = second->val;
second->val = temp;
}
private:
void search(TreeNode *root, TreeNode *&pre,
TreeNode *&first, TreeNode *&second) {
if (root == NULL)
return;
search(root->left, pre, first, second);
if (pre) {
if (pre->val > root->val) {
if (first)
second = root;
else {
first = pre;
second = root;
}
}
}
pre = root;
search(root->right, pre, first, second);
}
};