Difference between almost complete binary tree and complete binary tree?

A full tree is a tree where all nodes except the leaves have the maximum number of children. For a BST, that would be two children per node.

A complete tree is the same thing, except that the bottom level does not need to be full. It can be missing leaf nodes, however the ones present must be shifted to the left.