题目链接:https://leetcode-cn.com/problems/recover-binary-search-tree/
解题步骤:
- 二叉搜索树的中序遍历所有节点值的升序的,题目可以转换为恢复升序的中序遍历序列
- 中序遍历序列顺序:左子树、根节点、右子树,使用递归获取中序遍历序列
- 获取被交换的两个节点,如果a[ i ] > a[ i + 1],则可以确定第一个被交换节点,如果a[ i ] < a[ i - 1],则可以确定第二个被交换节点
- 最后,交换两个节点的值
C++实现:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
struct myNode {
int val;
TreeNode* p;
myNode(int _val, TreeNode *_p) {
val = _val;
p = _p;
}
};
vector<myNode> list;
void dfs(TreeNode* root) {
if (root->left) dfs(root->left);
list.push_back(myNode(root->val, root));
if (root->right) dfs(root->right);
}
void recoverTree(TreeNode* root) {
list.clear();
dfs(root);
int size = list.size();
TreeNode *l, *r;
for (int i = 0; i < size - 1; i++) {
if (list[i].val > list[i+1].val) {
l = list[i].p;
break;
}
}
for (int i = size - 1; i >= 1; i--) {
if (list[i].val < list[i-1].val) {
r = list[i].p;
break;
}
}
swap(l->val, r->val);
}
};