Binary Tree
Noun · Development
Definitions
A hierarchical data structure in which each node has at most two children (left and right), forming the basis for efficient search (BST), priority queues (heaps), and expression parsing.
In plain English: A data structure shaped like an upside-down tree where each item branches into at most two sub-items, making searching fast.
Example: "A balanced binary tree guarantees O(log n) lookups, but an unbalanced one degrades to a linked list."