dbo:abstract
|
- 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. (en)
- 在计算机科学, 顺序统计树是二叉搜索树的变种。除了插入、查询和删除,这种数据结构还支持以下两种操作:
* Select(i) — 在树中查询第i小的元素
* Rank(x) – 查找元素x的排名 这两种操作的平均时间复杂度是。当所用数据结构是平衡二叉树时,这是最坏复杂度。 (zh)
|
dbo:wikiPageExternalLink
| |
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 3192 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dct:subject
| |
gold:hypernym
| |
rdf:type
| |
rdfs:comment
|
- 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. (en)
- 在计算机科学, 顺序统计树是二叉搜索树的变种。除了插入、查询和删除,这种数据结构还支持以下两种操作:
* Select(i) — 在树中查询第i小的元素
* Rank(x) – 查找元素x的排名 这两种操作的平均时间复杂度是。当所用数据结构是平衡二叉树时,这是最坏复杂度。 (zh)
|
rdfs:label
|
- Order statistic tree (en)
- 顺序统计树 (zh)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |