← Arcesium questions
CodingReported in a candidate post, Jul 2025

Generate two BSTs with minimum maximum height

Filed under Arcesium

Given an array, partition it into two sets to build two Binary Search Trees such that the maximum height of the two trees is minimized.

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 Arcesium questions

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