数据结构：头尾节点插入示例代码（参考价值）

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;
typedef struct node{
      char element ;
      struct node *link ;
}Node ;
typedef struct lister{
      Node *first ;
      int lsize  ;
}Lister ;
Lister *createfromhead()
{
    Lister *L ;
    int flag = 1 ;
    char c ;
    Node *s ;
    L = (Lister *)malloc(sizeof(Lister)) ;
    L->lsize = 0 ;
    L->first = NULL ;
    while(flag){
        c = getchar() ;
        if(c != '$'){
                s = (Node *)malloc(sizeof(Node)) ;
                s->element = c ;
                s->link = L->first ;
                L->first = s ;
                L->lsize ++ ;