Bst

Data structure for storing sorted data.

Binary Tree Binary Search Structure

A Binary Search Tree (BST) is a data structure used in computer science to store and organize sorted data efficiently. Each node contains a key, with the left subtree containing keys less than the node's key and the subtree containing keys greater than it.

Etymology

BST is an abbreviation for Binary Search Tree, a term coined in computer science.

Explain Like I’m 5

A BST is like a super-organized filing cabinet where each folder (node) holds one piece of information, and the folders are arranged so you can quickly find what you're looking for.

Fun Facts

BSTs were invented by Donald Knuth in 1968
,A balanced BST allows for search times close to O(log n)
,BSTs are a fundamental concept in computer science

FAQ

What is a BST? A Binary Search Tree (BST) is a data structure that stores sorted data
,How does it work? Each node has at most two children, and the value in each node is greater than all values in its left subtree and less than all values in its right subtree
,What are BSTs used for? BSTs are commonly used for efficient searching, insertion, and deletion of data

Hypernyms — Broader Categories

data structure tree

Hyponyms — Specific Examples

AVL tree red-black tree

Meronyms — Parts or Components

node key left subtree right subtree

Indexes

data structure search strategy

Built by Tim Jones