binary tree

Definition from Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

binary tree (plural binary trees)

  1. (mathematics, computing) 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.

Hypernyms[edit]

Derived terms[edit]

Translations[edit]

References[edit]