Search
⌘K
Get Premium
Leetcode 1932. Merge BSTs to Create Single BST
Given n small BSTs (each ≤3 nodes) with distinct root values, determine whether you can repeatedly graft one tree into a leaf of another (when the leaf value equals the other's root) to form a single valid BST containing all nodes; return the merged root or null if no valid assembly exists.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.