Consider two binary search trees that contain the same set of unique keys, possibly in different orders.

Devise and analyze an efficient algorithm that will transform any given binary search tree into any other binary search tree (with the same keys) using only ZIG and ZAG rotations