Week 2: Analysis of Algorithms, Dynamic Data Structures (62)

Self-referential Structures (cont)

Create a new list node:

makeNode(v)
|  Input  value v
|  Output new linked list node with value v
|
|  new.value=v      // initialise data
|  new.next=NULL    // initialise link to next node
|  return new       // return pointer to new node