Problem_99. Recover Binary Search Tree - xwu36/LeetCode GitHub Wiki

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?

explanation: find and swap the min and max invalid nodes.