What time in terms of Big O will it take to merge two BST's in One? Each having no of nodes n and height O(log n) with no common element.
Resultant should be also a BST
Software Engineering Stack Exchange is a question and answer site for professionals, academics, and students working within the systems development life cycle. It only takes a minute to sign up.Sign up to join this community