Binary search trees problems

Plz also help on problem 3

Create a balanced BST using the 26 upper-case letters of the alphabet (A thru Z). Insert the following numbers into a binary search tree. It's possible to represent a BST in an array. For each of the elements that you inserted into a BST in problem 2, show the array index of that element