An IntNode is a struct defined as: typedef struct IntNode_struct { int dataVal; struct IntNode_struct* nextNodePtr; } IntNode; Using this linked list diagram: Address of node: 2000 2800 1500 3600 65 34 76 head and this code snippet: IntNode * current; current = head; What is the value stored of current->nextNodePtr->nextNodePtr? O 3 O 65 O 34 O 76 O 2000 O 2800 O 1500 O 3600

What function does a netlist serve?

1 T OR F Queue is a structure in which elements are added to the front and removed from the rear.

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };