Q1: When a new value is inserted into a set data structure, implemented as BST, what is true about the location of the new value within the structure? (a) The new value will be the value of a leaf node. (b) The new value will be the value of either a leaf node or an internal node. (c) The new value will become the new root value.

Q2: Let itr be a list iterator that references an item within a linked list. The statements (itr.currentLink)->prevLink->nextLink = (itr.currentLink)->nextLink; (itr.curentLink)->nextLink->prevLink = (itr.currentLink)->prevLink; are lines of code that (a) Play a role in inserting a new value into a linked list at the location of itr. (b) Play a role in doing a push_front() into the linked list. (c) Play a role in traversing a linked list from the back end to the front end. (d) None of the above apply.