About: Self-balancing binary search tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Self-balancing binary search tree Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDataStructures, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSelf-balancing_binary_search_tree

In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.These operations when designed for a self-balancing binary search tree, contain precautionary measures against boundlessly increasing tree height, so that these abstract data structures receive the attribute "self-balancing".

Attributes	Values
rdf:type	yago:WikicatSovietInventions yago:Ability105616246 yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:Creativity105624700 yago:DataStructure105728493 yago:Invention105633385 yago:PsychologicalFeature100023100 plant yago:Structure105726345 yago:WikicatDataStructures
rdfs:label	Árbol binario de búsqueda auto-balanceable (es) Albero binario di ricerca bilanciato (it) 平衡二分探索木 (ja) 자가 균형 이진 탐색 트리 (ko) Self-balancing binary search tree (en) Árvore binária de busca balanceada (pt) 平衡树 (zh)
rdfs:comment	平衡二分探索木（へいこうにぶんたんさくぎ、英: self-balancing binary search tree）とは、計算機科学において二分探索木のうち木の高さ（根からの階層の数）を自動的にできるだけ小さく維持しようとするもの（）である。平衡二分探索木は連想配列や集合その他の抽象データ型を実装する最も効率のよいデータ構造の1つである。 (ja) 컴퓨터 과학에서 자가 균형 (높이 균형) 이진 탐색 트리는 삽입과 삭제가 일어나는 경우에 자동으로 그 높이(루트에서부터 내려갈 수 있는 최대 레벨)를 작게 유지하는 노드 기반 이진 탐색 트리이다. 이 자료 구조는 변경이 가능한 정렬된 리스트의 효율적인 구현이며, 연관 배열(associative array), 우선순위 큐, 과 같은 다른 로 쓰일 수 있다. (ko) In informatica, un albero binario di ricerca bilanciato è un albero binario di ricerca la cui altezza, grazie a particolari condizioni che la sua struttura deve soddisfare, rimane limitata. Queste condizioni implicano delle operazioni di inserimento ed eliminazione più complesse rispetto a quelle di semplici alberi binari, ma garantiscono che esse vengano eseguite in O(log n). (it) Em ciência da computação, uma árvore binária de busca balanceada ou árvore binária de busca auto-balanceada é qualquer árvore de busca binária que automaticamente mantém a sua altura (número máximo de níveis abaixo da raiz) pequeno mesmo depois de sucessivas inserções e exclusões arbitrárias. Estas estruturas fornecem implementações eficientes para listas ordenadas mutáveis, podendo ser usadas para outras estruturas de dados abstratas, tais como arrays associativos, e conjuntos. (pt) 平衡树是计算机科学中的一类数据结构，为改进的二叉查找树。一般的二叉查找树的查询复杂度取决于目标结点到树根的距离（即深度），因此当结点的深度普遍较大时，查询的均摊复杂度会上升。为了实现更高效的查询，产生了平衡树。在这里，平衡指所有叶子的深度趋于平衡，更广义的是指在树上所有可能查找的均摊复杂度偏低。 (zh) En ciencias de la computación, un árbol binario de búsqueda auto-balanceable o equilibrado es un árbol binario de búsqueda que intenta mantener su altura, o el número de niveles de nodos bajo la raíz, tan pequeños como sea posible en todo momento, automáticamente. Esto es importante, ya que muchas operaciones en un árbol de búsqueda binaria tardan un tiempo proporcional a la altura del árbol, y los árboles binarios de búsqueda ordinarios pueden tomar alturas muy grandes en situaciones normales, como cuando las claves son insertadas en orden. Mantener baja la altura se consigue habitualmente realizando transformaciones en el árbol, como la rotación de árboles, en momentos clave. (es) In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.These operations when designed for a self-balancing binary search tree, contain precautionary measures against boundlessly increasing tree height, so that these abstract data structures receive the attribute "self-balancing". (en)
foaf:depiction
dcterms:subject	Binary trees Trees (data structures)
Wikipage page ID	378310 (xsd:integer)
Wikipage revision ID	1092928206 (xsd:integer)
Link from a Wikipage to another Wikipage	Quicksort Scapegoat tree Binary search tree Binary tree sort Day–Stout–Warren algorithm Node (computer science) Online algorithm Search data structure Geometric series Logarithm Cache (computing) Computational geometry Computer science Priority queue B-tree Treap Weight-balanced tree Fusion tree Linked list Abstract data type Amortized analysis 2–3 tree Floor and ceiling functions Hash table Heapsort Asymptotic AA tree AVL tree Binary trees Trees (data structures) Big O notation Red–black tree Associative array Splay tree Merge sort Randomized algorithm Tree rotation Set (abstract data type) Sorting Tango tree Point location Line segment intersection Skip list List (computing) Asymptotically optimal In-order iteration Key (database) Random binary search tree Computational overhead
Link from a Wikipage to an external page	https://xlinux.nist.gov/dads/HTML/heightBalancedTree.html http://adtinfo.org/
sameAs	Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree Self-balancing binary search tree

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software