LeetCode 669. Trim a Binary Search Tree
Posted 一片叶子啊
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:
Input: 3 / 0 4 2 / 1 L = 1 R = 3 Output: 3 / 2 / 1
Solution:
/** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } */ /** * @param {TreeNode} root * @param {number} L * @param {number} R * @return {TreeNode} */ var trimBST = function(root, L, R) { if(root == null) return null; if(root.val > R) { return trimBST(root.left, L ,R); } if(root.val < L) { return trimBST(root.right, L, R) } root.left = trimBST(root.left, L, R); root.right = trimBST(root.right, L , 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]Tree-669. Trim a Binary Search Tree
LeetCode 669. Trim a Binary Search Tree