Figure $2$ List implementation as a singly linked list rvute: begin and end are pointers to the front and back nodes respectively. see that the existence of the end pointer makes the implementation of some operations easier. To be able to access the data and the next members of a node from the list object, we define a node as a struct, instead of a class because we can access its three data members from the list class directly; the members of a struct are public by default.