Order statistic tree
http://dbpedia.org/resource/Order_statistic_tree an entity of type: WikicatSelectionAlgorithms
In computer science, an order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional operations beyond insertion, lookup and deletion:
* Select(i) – find the i'th smallest element stored in the tree
* Rank(x) – find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree Both operations can be performed in O(log n) worst case time when a self-balancing tree is used as the base data structure.
rdf:langString
在计算机科学, 顺序统计树是二叉搜索树的变种。除了插入、查询和删除，这种数据结构还支持以下两种操作：
* Select(i) — 在树中查询第i小的元素
* Rank(x) – 查找元素x的排名 这两种操作的平均时间复杂度是。当所用数据结构是平衡二叉树时，这是最坏复杂度。
rdf:langString
rdf:langString
Order statistic tree
rdf:langString
顺序统计树
xsd:integer
36548922
xsd:integer
1080673306
rdf:langString
In computer science, an order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional operations beyond insertion, lookup and deletion:
* Select(i) – find the i'th smallest element stored in the tree
* Rank(x) – find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree Both operations can be performed in O(log n) worst case time when a self-balancing tree is used as the base data structure.
rdf:langString
在计算机科学, 顺序统计树是二叉搜索树的变种。除了插入、查询和删除，这种数据结构还支持以下两种操作：
* Select(i) — 在树中查询第i小的元素
* Rank(x) – 查找元素x的排名 这两种操作的平均时间复杂度是。当所用数据结构是平衡二叉树时，这是最坏复杂度。
xsd:nonNegativeInteger
3192