Recover Binary Search Tree

Exactly two nodes of a BST were swapped by mistake. Recover the tree without changing its structure and print it in level-order.

2 <= number of nodes <= 1000