Difference between full and full binary tree

Definition of Prof. Adriano Cruz from UFRJ who I believe is very easy to understand:

  

A strictly binary tree is a binary tree in which each node   have 0 or 2 children. A full binary tree is a tree in which if a   node has some empty subtree so it is on the last level.

     

A tree is one in which n is a node with some subtree   empty, then n is located in the penultimate or last level. Therefore,   every full tree is complete and strictly binary.

Cheia (Full tree)

Complete(Completetree)

Like this boss:

Full binary tree : This is a tree where each node in the tree has 0 or 2 children (or leaves) nodes.

Fullbinarytree:Inabinarytreecompleteallbutthelastpossibleleveliscompletelyfull,andallnodesinthelastlevelareasfartotheleftaspossible.

Soitiscleartounderstandtheterm,"as much to the left as possible". Otherwise, the nodes will overlap.

I think the full binary tree definition given by MagicHat is incorrect because the full binary tree can not have a node with zero children before the last level and its response leaves this alternative open, but the image actually represents a binary tree full, looks at the definition of the book data structure and its algorithms, 2a. Edition. "A full binary tree is one in which, if v is a node with some of its empty trees, then v is located at the last level. It follows that every full binary tree is complete and strictly binary. "