sec definitions and properties ( (ba empty (cempty (dfigure two different binary trees (aa binary tree whose root has nonempty left child (ba binary tree whose root has non-empty right child (cthe binary tree of (awith the missing right child made explicit (dthe binary tree of (bwith the missing left child made explicit ( (bfigure examples of full and complete binary trees (athis tree is full (but not complete(bthis tree is complete (but not fullfigure illustrates the differences between full and complete binary trees there is no particular relationship between these two tree shapesthat isthe tree of figure (ais full but not complete while the tree of figure (bis complete but not full the heap data structure (section is an example of complete binary tree the huffman coding tree (section is an example of full binary tree while these definitions for full and complete binary tree are the ones most commonly usedthey are not universal some textbooks even reverse these definitionsbecause the common meaning of the words "fulland "completeare quite similarthere is little that you can do to distinguish between them other than to memorize the definitions here is memory aid that you might find useful"completeis wider word than "full,and complete binary trees tend to be wider than full binary trees because each level of complete binary tree is as wide as possible