is it possible to create an avl tree given any set of numbers? I am studying balanced trees, especially AVL trees. My question is whether is it possible to create an avl tree given any set of numbers. is it possible to prove the following statement?

Let $A$ be the set of integers. Given any set $A$, it's possible to create an avl tree corresponding to the given set of numbers.

Is there any way to prove or work out the above statement? I appreciate your answers.
AVL trees are a kind of binary search trees. As such, they implement the following operations, among else:

Initialize an empty tree.
Add a value to the tree.
Remove a value from the tree.
Search a value in the tree.

Try to use some of these operations to answer your question.