full binary tree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Noun

[edit]

full binary tree (plural full binary trees)

  1. (mathematics, computing) A binary tree in which each node has exactly two or zero children.
Retrieved from "https://en.wiktionary.org/w/index.php?title=full_binary_tree&oldid=44467169"