首页 > 代码库 > Recover Binary Search Tree
Recover Binary Search Tree
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?
/** * 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) { node1 = node2 = NULL; prev = new TreeNode(INT_MIN); check(root); int tmp = node1->val; node1->val = node2->val; node2->val = tmp; } void check(TreeNode *root){ if(root == NULL) return; check(root->left); if(node1 == NULL && prev->val >= root->val){ node1 = prev; } if(node1 != NULL && prev->val >= root->val){ node2 = root; } prev = root; check(root->right); } TreeNode *node1, *node2, *prev;};
Recover Binary Search Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。