Pohon biner terurut
Sign in to saveAlso known as BST, ordered binary tree, sorted binary tree
data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup
In the Vinony graph
Vinony's link graph records 213 inbound references to Pohon biner terurut, and connects out to tree, tree traversal and B-tree.
It sits within the topics Binary trees and Search trees.
Vinony links it to 37 Wikipedia language editions.
Key facts
- Type
- tree
- Invented by
- P.F. Windley, A.D. Booth , A.J.T. Colin , and T.N. Hibbard
- Operation
- Average
- Search
- Θ(log n )
- Insert
- Θ(log n )
- Delete
- Θ(log n )
- Space
- Θ( n )
via Wikipedia infobox
Wikidata facts
- Instance of
- data structure
- Subclass of
- binary tree
- Image
- Binary search tree.svg
Show 6 more facts
- Commons category
- Binary search trees
- time of discovery or invention
- 1960-00-00
- discoverer or inventor
- Andrew Donald Booth
- inception
- 1960-01-01
- Stack Exchange tag
- stackoverflow.com/tags/binary-search-tree
- studied by
- algorithmics
Sources (3)
via Wikidata · CC0
Connections
tree
Entity
tree traversal
Entity
B-tree
Entity
binary search algorithm
Entity
linked list
Entity
red–black tree
Entity
AVL tree
Entity
abstract data type
Entity
time complexity
Entity
set
Entity
self-balancing binary search tree
Entity
computer science
Entity
International Standard Book Number
Entity
Stanford University
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Cornell University
Entity
Donald Knuth
Entity
University of Toronto
Entity
data structure
Entity