Noun
full binary tree (plural full binary trees) (mathematics, computing) A binary tree in which each node has exactly two or zero children.