in both the cases complexity would be O(n)....
procedure:- find inorder (O(n)) traversal of both tree and merge them :-(2O(n) for inorder+O(2n-1)for merging...
therefor O(n)
Note:-point to be noticed ..in case of BST Inorder traversal will be in ascending order (sorted array)