Given the root nodes of two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.
Constraints:
The number of nodes in each tree is in the range
Node.val
Given the root nodes of two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.
Constraints:
The number of nodes in each tree is in the range
Node.val