Self-balancing binary search tree
id:
self-balancing-binary-search-tree-286-18290190
title:
Self-balancing binary search tree
text:
In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height 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". For height-balanced binary trees, the height is defined to be logarithmic O
brand slug:
wiki
category slug:
encyclopedia
description:
Any node-based binary search tree that automatically keeps its height the same
original url:
https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
date created:
date modified:
2024-01-27T16:37:11Z
main entity:
{"identifier":"Q245955","url":"https://www.wikidata.org/entity/Q245955"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/a9/Unbalanced_binary_tree.svg","width":800,"height":800}
fields total:
13
integrity:
15