title: Pseudocode for removing a node of a linked list
body: <p>Suppose that p is a pointer to a node in a linked list, and *p is not the tail node. What are the steps to removing the node after *p? Use one short English sentence for each step.</p>
  
  <p>My thoughts were:
  1) Create a temporary variable of type class node and assigns p->next to the temporary variable – call this variable temp. </p>
  
  <p>2) Assign temp’s next pointer to p’s next pointer.</p>
  
  <p>3) Set the next pointer of the node after *p to NULL. </p>
  
  <p>This has made it so that the node after *p does not exist in the linked list, but does it still take up memory? Or since in step 3 I set the pointer to NULL, that node I removed now has no more memory? Would I need to use free() or delete function?</p>