write a function inside a BST that takes an array A of type and an integer n that denotes the size of A ... look at the picture above

Write a function inside a BST that takes an array A of type and an integer n that denotes the size of A along with any other additional argument that is needed. At end of the function, the array should be sorted from largest to smallest number. Also, tell me what the initial call to this function will be? (Non-anonymous question)