Binary Search Tree

Views Updated: Dec 15, 2025

Key Facts

Abbreviation
BST
Pronunciation
/ˈbaɪnəˌri sərʧ tri/
Category
Computing
Related Field
Assembly

Examples in Context

  1. It maintains the free space in heap as nodes in a Cartesian binary search tree format.
  2. Red-black tree is a self-balancing binary search tree.
  3. Unlike other self-balancing binary search trees that provide worst case O ( log n ) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
  4. A scapegoat tree is a self-balancing binary search tree, that provides worst-case O ( log n ) lookup time, and O ( log n ) amortized insertion and deletion time.
  5. Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.

Other meanings of BST

But Seriously Though Internet
British Summer Time [UTC + 0100] Regional
British Summer Time Gov
British Standard Time [UTC + 0100] Regional
British Summer Time [GMT + 0100] Academic
Barium Strontium Titanate Academic
Battle Support Team Gov
Basic Skills Test Community
Buy, Sell, and Trade Business
Buy Sell Trade Business