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.