Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- All Possible Full Binary Trees
Coding
- Logical OR of Two Binary Grids Represented as Quad-Trees
Coding
- Merge Two Binary Trees
Coding
- Phone Screen: Two classic leetcode problems in the Top 30 list. One tests binary search in a sorted array, another one tests graph search using Breath First Search or Depth First Search algorithm
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1305. All Elements in Two Binary Search Trees
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source