1. Write range method for a Binary Search Tree, which returnsthe difference between the minimum and maximum data.
2. Write rotateRightChild, which takes an avlNode, and rotatewith its Right Child, update the height and return the newnode.
3. Write unique, which takes an ArrayDeque of Integers, then useTreeSet of JCF, to return the same Integers with duplicatesremoved, in a sorted ArrayDeque.
Answer