This part looks simple, but actually has some magic:
It considered the situation that the swapped 2 nodes are next to each other.
The firstElement will only be put on value once,
but the secondElementwill be put on value once or twice, depends on the 2 swapped elements are next to each other or not.
Recover Binary Search Tree