can you explain the use of multiple arrow operators at the end of this function? prev is a pointer to the node before this, nexet a pointer to the node after. My understanding is that temp->next->prev = temp; is accessing the memory location of both next and prev and pointing it towards temp, but temp is just a node so what is the point? is this correct?

//REQUIRES: i is a valid iterator associated with this list //EFFECTS: inserts datum before the element at the specified position. Note: this can be used // to insert anywhere in the list, including at the beginning or at the end. If i is at the end of the // list (list.end()), then it will cause an insertion at the back of the list. It does not modify // the element that the existing iterators, including this iterator, point to. void insert (iterator i, const T &datum){ assert( (end))); if (begin)-i)t insertFront (datum); else if iend())( insertBack(datum); else Node *tempnew Node; temp->datum = datum; temp->prev - i.node ptr->prev; temp->next = 1.node_ptr; temp->next->prev = temp ; temp->prev->next temp