Leetcode 669. Trim a Binary Search Tree
Given a BST and bounds [low, high], remove all nodes with values outside the interval while preserving the relative parent–child structure of remaining nodes; exploit the BST ordering to skip whole left or right subtrees and return the (possibly changed) new root.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.