A complete binary tree is
Your answer:
Each node has exactly zero or two children
A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left
A tree in which all nodes have degree 2
A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right
A binary tree which is also full