Knowing that you can not have searched the entire internet, at least not properly, I'll point you to the simplest resource that may help you find better search terms for your question: Wikipedia.
A perfect binary tree is a full
binary tree in which all leaves are
at the same depth or same
level.[3] (This is ambiguously also called a complete binary tree.)
A complete binary tree is a binary
tree in which every level, except
possibly the last, is completely
filled, and all nodes are as far left
as possible.[4]