自平衡二叉搜索树
Sign in to saveAlso known as self balancing binary search tree
any node-based binary search tree that automatically keeps its height small
In the Vinony graph
Within Vinony's link graph, 自平衡二叉搜索树 is referenced by 159 other articles, and connects out to B-tree, tree and list.
It is catalogued under topics including Binary trees and Trees (data structures).
Its subject is documented across 14 Wikipedia language editions.
Wikidata facts
- Image
- AVLtreef.svg
Show 2 more facts
- studied by
- graph theory
- Commons category
- Balanced trees
Sources (3)
via Wikidata · CC0
Article · 中文
平衡树是计算机科学中的一类数据结构，为改进的二叉查找树。一般的二叉查找树的查询复杂度取决于目标结点到树根的距离（即深度），因此当结点的深度普遍较大时，查询的均摊复杂度会上升。为了实现更高效的查询，产生了平衡树。 在这里，平衡指所有叶子的深度趋于平衡，更广义的是指在树上所有可能查找的均摊复杂度偏低。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
B-tree
Entity
tree
Entity
list
Entity
computer science
Entity
International Standard Book Number
Entity
logarithm
Entity
Donald Knuth
Entity
data structure
Entity
cache
Entity
asymptote
Entity
quicksort
Entity
stack
Entity
array data structure
Entity
queue
Entity
merge sort
Entity
hash table
Entity
linked list
Entity
heap
Entity
geometric series
Entity
big O notation
Entity