[LeetCode] 938. Range Sum of BST 二叉搜索树的区间和
Given the `root` node of a binary search tree, return the sum of values of all nodes with value between `L` and `R` (inclusive). The binary search ...
原文：[Swift]LeetCode938. 二叉搜索树的范围和 | Range Sum of BST
微信公众号：山青咏芝 shanqingyongzhi 博客园地址：山青咏芝 https: www.cnblogs.com strengthen GitHub地址：https: github.com strengthen LeetCode 原文地址：https: www.cnblogs.com strengthen p .html 如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。 原文已 ...
2018-11-11 13:32 0 1527 推荐指数：
相关推荐
[LeetCode] Two Sum IV - Input is a BST 两数之和之四 - 输入是二叉搜索树
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given ...
[LeetCode] Split BST 分割二叉搜索树
Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes ...
二叉搜索树（BST）详解
； 如图（一颗长残了的BST）： 二叉搜索树的查询： 若根结点的关键字值等于查找的关键字，返回 ...
二叉搜索树BST
二叉查找树（Binary Search Tree），（又：二叉搜索树，二叉排序树）它可以是一棵空树，也可以是具有下列性质的二叉树： 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值； 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值； 它的左、右子树也分别为二叉排序树。二叉 ...
[LeetCode] Convert BST to Greater Tree 将二叉搜索树BST转为较大树
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum ...
[LeetCode] Serialize and Deserialize BST 二叉搜索树的序列化和去序列化
Serialization is the process of converting a data structure or object into a sequence of bits so ...
[LeetCode] 285. Inorder Successor in BST 二叉搜索树中的中序后继节点
Given a binary search tree and a node in it, find the in-order successor of that node in the BST. The successor of a node p is the node ...