How do I make a completely unbalanced binary search tree by using java?

For example I have an array A[1,2,3,4,5,6,7,8,9] and then I want to put these elements into a empty Binary search tree that will make this tree completely unbalanced.