Suppose  a BST contains the integer values 1 through 15  and is a perfect binary tree.   a)  Draw the tree.   b) Suppose we call the removeViaReplace method, with r equal to the root of the tree in Part a.  List the numbers in child->value at the beginning of each iteration of the while loop in the code below. After that, redraw the tree upon completion of the removeViaReplace function.   c) Repeat Part b, but use the tree obtained at the end of Part b as the initial tree this time.       static void removeViaReplace(Node* r) {         Node* temp = r->right;         if (temp->left == nullptr) {             r->value = temp->value;             r->right = temp->right;             delete temp;         }         else {             Node* child = temp->left, * parent = temp;             while (child->left != nullptr) {                 parent = child;                 child = child->left;             }             r->value = child->value;             parent->left = child->right;             delete child;         }     }

Can somebody tell me the answer to this?

Add more methods to the singly linked list class then test them• search(e) // Return one node with 3 values (stuID, stuName, stuScore) which matches agiven key e (studentID).• addAfter(e, stuID, stuName, stuScore) //Add a new node with 3 values (stuID,stuName, stuScore) after the node with the key e (studentID).• removeAt(e) //Remove a node which matches a given key e (studentID)• count() //Return a number of nodes of list.• update(stuID, stuName, stuScore) //Update the values of one node three codes below two in pictures one,typed out. public class SlinkedList<A,B,C> {    private Node head;    private Node tail;    private int size;        public SlinkedList(){        head=null;        tail=null;        size=0;    }        public int getSize(){        return size;    }        public boolean isEmpty(){        return size == 0;            }    public A getFirstStuId(){    if(isEmpty())        return null;    return (A) head.getStuID();}public B getFirstStuName(){    if(isEmpty())…

Assume that the nodes of the singly linked lists are arranged in decreasing order of the exponents of the variable x in order to add the two polynomials.The objective is to create a fresh list of nodes that represents the addition of P1 and P2. This is done by adding the COEFF fields of nodes in lists P1 and P2 that have identical powers of variable x, and then making a new node in the resulting list P1 + P2. The key part of the technique is shown below.The start pointers of the singly linked lists that correspond to the polynomials P1 and P2 are P1 and P2, respectively. Two temporary pointers, PTR1 and PTR2, are created with starting values of P1 and P2, respectively. Make procedural code.