带头节点与不带头节点单链表

带node与不带node单链表

不带头结点

带头结点

示例代码

//定义结构体

typedef struct Link{
    int num;
    Link *next;
}Inode;

//憨头结点
//运用尾插法进行单链表的建立
class  LinkedList{
    Inode *CreateListByTrail(Inode *head,int n);
    public  Inode *LinkedList::CreateListByTrail(Inode *head,int n){
        Inode  *p=head;
        for(int i=0;i<n;i++){
            Inode  *s==new Inode;
            cin>>s-num;
            s-next=p->next;
            p-next=s;
            p=s;
        }
    }
    //不含头节点(用逆置链表来表明)
    Inode **LinkedList::ReverseLink(INode *h){
        Inode *headNext,*headPre;
        headNext=h-next;
        headPre=h;
        h-next=null;
        while(headNext){
            Inode *temp=headNext->nest;
            headNext->next=headPre;
            headPre=headNext;
            if(temp=null){
                h=headPre;
            }
            headNext=temp;
        }
        return h;
    }
    
}