Recover Binary Search Tree (Morris O(1) space inorder traversal)

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?
confused what "{1,#,2,3}" means?