669. Trim a Binary Search Tree（修剪搜索二叉树）

题目描述 Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the

>>阅读原文<<