然后接在node.left, node.right. 方法2: 用迭代, 还没有写. 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 ...