Given the following keys L$,$ A$,$ P$,$ G$,$ C$,$N$,$ W$,$ B$,$ M$,$ Q$,$ F$,$ Y$,$ V$,$ T$,$ R

$1.$ Assuming the keys are inputted in that order, build a binary search tree according to the inputs

$2.$ Use an array to implement the tree you built and show the contents of the array

$3.$ Assuming the keys are all available at once, and you can change the order if necessary, build a balanced binary search tree