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.
Please see the file attached for the full solution.
This job focuses on working with the binary search tree