Why is it desirable that a binary search tree be well balanced?Group of answer choicesThe tree might fall over if it's not balanced.More information can be stored in a binary search tree if it is balanced.It is easier to perform AVL rebalancing on such a tree.There is less memory use in a balanced trree.The average search time will be minimized if the internal path length is minimized.