Merge two binary search trees in O(n) time, O(lgn) stack space needs to be used during constructing BST from sorted list.