Use B-Tree as a sorting machine. Write a java program that’s passed an array of key values from main() to B-Tree and it writes them back to the array in sorted order.

An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one. When this property is violated after an insertion or deletion, the ...