Working with the binary search tree and complete tree and proving that it can be done for an arbitrary number of nodes.

Give an example of a binary search tree which is a complete tree. Can it be done for an arbitrary number of nodes? Prove your answer.