Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.