Question 11 Proper ancestor of a node v is defined as: Any node, on the path from the root to the node? Excluding v. Including v. Siblings of v. Children of v. OOO

Given Class:- import java.util.*; // Iterator, Comparatorpublic class BinarySearchTree<T> implements BSTInterface<T>{protected BSTNode<T> root; // reference to the root of this BSTprotected Comparator<T> comp; // used for all comparisonsprotected boolean found; // used by removepublic BinarySearchTree() // Precondition: T implements Comparable// Creates an empty BST object - uses the natural order of elements.{root = null;comp = new Comparator<T>(){public int compare(T element1, T element2){return ((Comparable)element1).compareTo(element2);}};}public BinarySearchTree(Comparator<T> comp) // Creates an empty BST object - uses Comparator comp for order// of elements.{root = null;this.comp = comp;}public boolean isFull()// Returns false; this link-based BST is never full.{return false;}public boolean isEmpty()// Returns true if this BST is empty; otherwise, returns false.{return (root == null);}public T min()// If this BST is empty, returns null;//…

Question 15 Why does our node class have two versions of the link member function? One is public, the other is private. One is to use with a const pointer, the other with a regular pointer. One returns the forward link, the other returns the backward link. One returns the data, the other returns a pointer to the next node.

Please answer the following section.