Normally, Full binary tree means every level node has either 0 or 2 childrens, but perfect binary tree means every level( except last level, i.e., in which level leaves exist ) node should have 2 childrens.
In the GATE Exam, I hope they define these terms