Suppose two subtrees in a Binary search trees has been swapped, and that the BST property is broken. Devise an algorithm that identifies the two swapped subtrees in O(n) time.
