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?
见程序注释
This repository has been archived by the owner on Sep 20, 2023. It is now read-only.