← Microsoft questions

Merge two BSTs in O(logn)

Filed under Microsoft

Discuss approaches to merge two Binary Search Trees (BSTs) and implement an optimal solution running in O(n + m) or O(log n + log m) time where n and m are the number of nodes.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.