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 available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.