Given the roots of two binary search trees, `root1` and `root2`, merge them into a single sorted list containing all elements from both trees in O(m+n) time complexity, where m and n are the number of…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.