diff options
author | jack <0x6A73@pm.me> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <0x6A73@pm.me> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /recover_BST.cpp | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'recover_BST.cpp')
-rw-r--r-- | recover_BST.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/recover_BST.cpp b/recover_BST.cpp new file mode 100644 index 0000000..9120825 --- /dev/null +++ b/recover_BST.cpp @@ -0,0 +1,27 @@ +#include "leetcode.h" + +class Solution { +public: + vector<pair<TreeNode *, TreeNode *>> vec; + void recoverTree(TreeNode *root) { + inOrder(root); + if (vec.size() == 1) + swap(vec[0].first->val, vec[0].second->val); + if (vec.size() == 2) + swap(vec[0].first->val, vec[1].second->val); + } + +private: + TreeNode *prev = NULL; + void inOrder(TreeNode *root) { + if (!root) + return; + inOrder(root->left); + if (prev && prev->val > root->val) + vec.push_back({prev, root}); + prev = root; + inOrder(root->right); + } +}; + +int main() {} |