Binary search tree

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Export map as:

Research this topic

Explore the main themes, entities and connections around Binary search tree. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

History

Andrew Donald Booth Andrew Colin Thomas N. Hibbard Labeled data Magnetic tapes

8 related topics

Overview

Computer science Rooted Binary tree Data structure Linear

37 related topics

Operations

Iteratively Root node Nil Leaf nodes In-order

6 related topics

Balanced binary search trees

T-tree Red-black tree B-tree 2–3 tree Splay tree

5 related topics

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Delete: Θ(log n)
Insert: Θ(log n)
Invented: 1960
Invented by: P.F. Windley, A.D. Booth, A.J.T. Colin, and T.N. Hibbard
Operation: Average
Search: Θ(log n)

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Computer science
Rooted Rooted tree
Binary tree
Data structure
Linear Time complexity
Binary search Binary search algorithm
Binary logarithm
Conway Berners-Lee
David Wheeler David Wheeler (computer scientist)
Linear search time Linear time
Complexity analysis Computational complexity theory
On average Best, worst and average case
Self-balancing Self-balancing binary search tree
AVL trees
Georgy Adelson-Velsky
Evgenii Landis
Abstract data types Abstract data type
Dynamic sets Set (abstract data type)
Lookup tables Lookup table
Priority queues Priority queue
Sortings Sorting algorithm
Tree sort
Strict total order Total order
Height of the tree Tree (data structure)
Binary search
Search algorithms Search algorithm
Singly linked list
Linked list
Abstract data structures
Multisets Set (computer science)

History

Operations

Iteratively Iteration
Root node
Nil Null pointer
Leaf nodes
In-order Tree traversal
Helper function

Traversal

Inorder Inorder traversal
Preorder Pre-order traversal
Postorder Post-order traversal

Balanced binary search trees

Examples of applications

Quicksort

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Nodes67

Edges66

Triples133

Avg. degree1.97

Density0.029851

Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Binary search tree

Top relations

related to Further reading · 51

Binary search tree → Addison-Wesley, Algorithms, Algorithms Visualization-A PowerPoint Slides, April, Archived, Based Approach, Binary, Binary Tree Searching, Binary Tree Traversals, Binary Trees, Black, Charles, Clifford, Computer Programming, Cormen, CS Education Library, Data Structures, December, Dictionary, Donald

related to history · 12

Binary search tree → Andrew Colin, Andrew Donald Booth, AVL, Conway Berners-Lee, David Wheeler, Hibbard, One, The, Thomas, Treaps, Various, Windley

related to Insertion · 7

Binary search tree → After, BST, Following, If, New, Operations, The

related to External links · 6

Binary search tree → An Introduction, Balanced Trees, Ben Pfaff, Binary Search Tree Visualization, Binary Search Trees, PDF

related to Deletion · 5

Binary search tree → Alternatively, BST, If, NIL, The

related to Searching · 5

Binary search tree → If, Otherwise, Searching, Similarly, This

related to Priority queue operations · 4

Binary search tree → Adding, Binary, BST, If

related to Types · 4

Binary search tree → B-tree, Splay, T-tree, There

related to Balanced binary search trees · 3

Binary search tree → Keeping, This, Without

related to overview · 3

Binary search tree → Binary, BST, However

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

search tree binary displaystyle bst trees node text key nodes data right operations complexity left subtree height root used algorithms

Entity relationships Subject–Predicate–Object triples

Subject	Predicate	Object	Confidence	Src
Binary search tree	Delete	Θ(log n)	1.00	infobox
Binary search tree	Insert	Θ(log n)	1.00	infobox
Binary search tree	Invented	1960	1.00	infobox
Binary search tree	Invented by	P.F. Windley, A.D. Booth, A.J.T. Colin, and T.N. Hibbard	1.00	infobox
Binary search tree	Operation	Average	1.00	infobox
Binary search tree	Search	Θ(log n)	1.00	infobox
Binary search tree	Space	Θ(n)	1.00	infobox
Binary search tree	Time complexity in big O notation	Time complexity in big O notationOperation Average Worst caseSearch Θ(log n) O(n)Insert Θ(log n) O(n)Delete Θ(log n) O(n)Space complexitySpace Θ(n) O(n)	1.00	infobox
Binary search tree	Type	tree	1.00	infobox
Binary search tree	is a	rooted binary tree in which nodes are arranged in strict total order in which the nodes with keys greater than any particular node A is stored on the right sub-trees to that nod…	0.90	text
dynamic sets	instance of	invented in 1962 by Georgy Adelson-Velsky and Evgenii Landis.Binary search trees can be used to implement abstract data types	0.80	text
lookup tables	instance of	invented in 1962 by Georgy Adelson-Velsky and Evgenii Landis.Binary search trees can be used to implement abstract data types	0.80	text

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

Connections between topic areas Semantic bridges

Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

Min side: 3