In C++ Construct a binary search tree, in order from the intergers given in the input argument vector. Assume there are no duplicates given. Assume the tree is order as follows: left child is smaller then parent , right child is larger then the parent.  Insert nodes in the order provided do not balance or reorder. Inputs: {1,2,3,4},4,2

True/False Select true or false for the statements below. Explain your answers if you like to receive partial credit. 3) Which of the following is true about the insertBeforeCurrent function for a CircularLinked List (CLL) like you did in programming exercise 1?a. If the CLL is empty, you need to create the new node, set it to current, andhave its next pointer refer to itselfb. The worst case performance of the function is O(n)c. If you insert a new element with the same data value as the current node, theperformance improves to O(log n)

Assume a linked list contains following integers: 7, 2, 9, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; Node<int> *aNode; int s; while(curNode!=NULL){ {       aNode=curNode;       curNode=curNode->getNext(); } s=aNode->getItem();   A. 15 B. 3 C. 7 D. 2

IN C LANGUAGE When inserting a node into a linked list, where (in memory) will that node be placed if there is no overflow?                                                                                                                                    A) The location of the AVAIL pointer B) The next contiguous spot of memory from the last node C) The very end of the contiguous memory block D) A randomized memory location