binary tree

Short definition from Wiktionary

Noun

A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles.

We haven’t written up binary tree yet: Simple and Standard meanings, examples and a quiz.