Insert n Ordered Values in AVL tree in O(n)?

Question

I have an n sized array with inputs ordered from 0,1,2,...,n and would like to insert those n inputs into avl tree in O(n) and not using the usual way which takes time compl