题目描述
二叉搜索树有两个节点的值被交换了,不改变树的结构,恢复二叉树。
思路
根据中序遍历顺序,找出不符合的节点。
代码
/**
* 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:
void recoverTree(TreeNode* root) {
TreeNode *pre = NULL, *first = NULL, *second = NULL;
TreeNode* p = root;
stack<TreeNode*> st;
while(p || !st.empty()) {
while(p) {
st.push(p);
p = p->left;
}
p = st.top();
st.pop();
if (pre) {
if (pre->val > p->val) {
if (!first) first = pre;
second = p;
}
}
pre = p;
p = p->right;
}
swap(first->val, second->val);
}
};