Skip to content

Practice All Elements in Two Binary Search Trees

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1305
LeetCode Problem

All Elements in Two Binary Search Trees

TreeDepth-First SearchBinary Search TreeSortingBinary Tree

Problem Statement

Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.

Source: All Elements in Two Binary Search Trees on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root1 = [2,1,4], root2 = [1,0,3]
Output
[0,1,1,2,3,4]

# Example 2

Input
root1 = [1,null,8], root2 = [8,1]
Output
[1,1,8,8]

Constraints

The number of nodes in each tree is in the range [0, 5000].
-10^5 <= Node.val <= 10^5

Related LeetCode Problems

Practice more problems similar to All Elements in Two Binary Search Trees.

98 Validate Binary Search Tree Medium99 Recover Binary Search Tree Medium94 Binary Tree Inorder Traversal Easy95 Unique Binary Search Trees II Medium96 Unique Binary Search Trees Medium
← Previous Find N Unique Integers Sum up to ZeroNext → Jump Game III

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free