Binary-tree Definition

noun

(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.

Wiktionary

Other Word Forms of Binary-tree

Noun

Singular:
binary-tree
Plural:
binary-trees

Binary-tree Is Also Mentioned In

Find Similar Words

Find similar words to binary-tree using the buttons below.

Words Starting With

Words Ending With

Unscrambles

binary-tree