Devise 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. Your algorithm should run in time O(n) or better.