What are the instructions for establishing a singly linked list?

#include

#define max 100

using namespace std;

typedef int datatype;

typedef struct seq{

datatype data[max];

int last;

seqlist;

seqlist * init_seqlist()seqlist *l; int i;

l=new seqlist;

cout<<"Please enter the length of the sequential table"<>l->last;

l->last--;

cout<<"Please enter the contents of the sequence table">l->data[i];

return l;

void print(seqlist *l)int i;

cout<<"The contents of the sequential table are:"void part(seqlist *l)int i,j;

datatype x,y;

x=l->data[0];* Place datum into x * for (i=1; i<=l->last; i++)if (l->data[i]data[i];

for(j=i;j>0;j--) *move* l->data[j]=l->data[j-1];

l->data[0]=y;

int main()

seqlist *l;

l=init_seqlist();

print(l);

part(l);

print(l);

return 0;

Does this C++ work? I have more details in my blog.

If you think the address is helpful, you can give points.

1) The head node is a node that is attached before the start node of the linked list. It has two advantages: first, because the position of the start node is stored in the pointer field of the head node, the operation in the first position of the linked list is the same as the operation in the other positions of the table, and no special treatment is required. The second is that regardless of whether the linked list is empty or not, its head pointer is a non-empty pointer pointing to the head node, so the treatment of empty and non-empty tables is unified.

2) The order of the single-linked list nodes established by the header interpolation method matches the order of the input of the data elements, that is, the first input node is the end node of the linked list, and the last input node is the beginning node of the linked list. The header insertion method requires the use of two pointers, one for the head pointer l and one for the pointer p to the newly created node.

2) Whether it is the header insertion method or the tail insertion method, if the nodes to be established for a singly linked list are n, the time complexity of the algorithm is o(n).

4) For a single-linked list, no matter what kind of operation is involved, as long as it involves hooking (or rehooking), if there is no direct successor explicitly given by the source selling idea, the order of hooking (or rehooking) must be "right first and then left", that is, the arrow is assigned to the tail of the arrow.

The n nodes of a linear table are linked together in their logical order through the chain domain of each node, and if each node of the linked list has only one link domain, this kind of linked list is called a singly linked list.

The storage address of each node in a single-linked list is stored in the pointer domain of its predecessor node, and the start node has no precursor, so the head pointer should be set to point to the start node, and the terminal node has no successor, so the pointer domain of the terminal node is empty, that is, null (represented by in the figure). The structure of a singly linked list is shown in Figure 1 and Figure 2.

Figure 1: A single chain without a head node represents the meaning.

Figure 2: The single-strand representation of the lead node is indicated.