Leetcode 1305. All Elements in Two Binary Search Trees
Given two binary search trees, return a single list of all values from both trees in ascending order. The key challenge is to exploit the BST property (in-order traversal yields sorted sequences) and merge those two sorted streams efficiently (each tree has up to 5,000 nodes).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.