← Microsoft questions

Remove BST keys outside given range

Filed under Microsoft · Also reported at Gemini

Given the root of a Binary Search Tree (BST) and a low and high boundary [min, max], trim the tree such that all its elements lie in [min, max].

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.