[leetcode-669-Trim a Binary Search Tree]
Posted hellowOOOrld
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[leetcode-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 result should return the new root of the trimmed binary search tree.
Example 1:
Input: 1 / 0 2 L = 1 R = 2 Output: 1 2
Example 2:
Input: 3 / 0 4 2 / 1 L = 1 R = 3 Output: 3 / 2 / 1
思路:
递归即可。
TreeNode* trimBST(TreeNode* root, int L, int R) { if (root == NULL || L>R)return NULL; if (root->val == L) { root->left = NULL; root->right = trimBST(root->right, L + 1, R); return root; } else if (root->val == R) { root->right = NULL; root->left = trimBST(root->left, L, R - 1); return root; } else if (root->val<L)return trimBST(root->right, L, R); else if (root->val>R)return trimBST(root->left, L, R); else { root->left = trimBST(root->left, L, root->val - 1); root->right = trimBST(root->right, root->val + 1, R); return root; } }
以上是关于[leetcode-669-Trim a Binary Search Tree]的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode 669. Trim a Binary Search Tree
LeetCode 669. Trim a Binary Search Tree
[leetcode]669. Trim a Binary Search Tree寻找范围内的二叉搜索树