Part A: 1. Write range method for a Binary Search Tree, which returns the difference between the minimum and maximum data. 2. Write rotateRightChild, which takes an avlNode, and rotate with its Right Child, update the height and return the new node. 3. Write unique, which takes an ArrayDeque of Integers, then use TreeSet of JCF, to return the same Integers with duplicates removed, in a sorted ArrayDeque.Use this to TEstimport java.util.Iterator; import java.util.ArrayDeque; import java.lang.Math; public class AvlTree<E extends Comparable<? super E>> implements Iterable<E>{ private static class AvlNode<E extends Comparable<? super E>>{
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured