簡單鏈表實現c++實現

#include <iostream>
#include <cstring>
using namespace std;

struct Student
{
    int id;
    string name;
    Student* next;
};
void printNodeInfo(Student* node);
void release(Student* node);
int main()
{
    Student* head;
    Student* p1 = new Student;
    Student* p2 = new Student;
    Student* p3 = new Student;
    p1 ->id = 1001;
    p1 ->name = "zhangsan";
    p2 ->id = 1002;
    p2 ->name = "lisi";
    p3 ->id = 1003;
    p3 ->name = "wangwu";
    head = p1;
    p1 ->next = p2;
    p2 ->next = p3;
    p3 ->next = NULL;
    
    p1 = p2 = p3 = NULL;
    printNodeInfo(head);
    //釋放節點內存
    release(head);
    
    return 0;
}
void printNodeInfo(Student* node)
{
    while(node != NULL)
    {
        cout << node ->id << " " << node ->name << endl;
        node = node ->next;
    }
}
//void release(Student* node)
//{
//    if(node == NULL)
//    {
//        cout << "鏈表為空" << endl;
//    }
//    while(node != NULL)
//    {
//        Student* temp = node;
//        node = node ->next;
//        delete temp;
//        cout << "節點內存清除成功" << endl;
//    }
//}
//改進release方法
void release(Student* node)
{
    //創建一個臨時節點 用於刪除上一個節點內存 
    Student* temp = NULL;
    if(node == NULL)
    {
        cout << "鏈表為空\n";
    }
    else
    {
        while(node != NULL)
        {
            temp = node;
            node = node ->next;
            delete temp;
            cout << "節點內存清除成功\n";
        }
    }
}