Binary tree Computer Science Fundamentals
noun phrase
Definition: A rooted tree data structure in which each node has at most two children (commonly called the left and right child) [Britannica].
Example in context: “During B&B search, a binary tree is constructed by dividing solution space with constraining non-integer solutions.” [Canturk et al. 2024]
Synonym: bintree
Related terms: tree data structure, binary search tree (BST), rooted tree