full binary tree

English

Noun

full binary tree (plural full binary trees)

  1. (mathematics, computing) A binary tree in which each node has exactly two or zero children.
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.