思路:如果我们可以用额外的数组得到中序遍历的结果,那么我么可以相对容易的解决这个问题。不用额外的空间,可以用O(N)的时间通过中序遍历整棵树来解决。对于每次访问到一颗子树,我们需要然它知道它的前一个节点。
方法一:
/**
* 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
left = right = NULL;
TreeNode *prev = NULL;
recoverTree(root, prev);
swap(left->val, right->val);
}
void recoverTree(TreeNode *root, TreeNode* &prev)
{
if(root == NULL) return;
recoverTree(root->left, prev);
if(prev != NULL && prev->val > root->val)
{
if(left == NULL)
left = prev, right = root;
else
right = root;
}
prev = root;
recoverTree(root->right, prev);
}
private:
TreeNode *left, *right;
};
方法二:
/**
* 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
left = right = NULL;
recoverTree(root, NULL);
swap(left->val, right->val);
}
TreeNode *recoverTree(TreeNode *root, TreeNode* prev)
{
if(root == NULL) return prev;
prev = recoverTree(root->left, prev);
if(prev != NULL && prev->val > root->val)
{
if(left == NULL)
left = prev, right = root;
else
right = root;
}
return recoverTree(root->right, root); ;
}
private:
TreeNode *left, *right;
};