数据结构(C++)——链表
链表结构体的定义:
// struct ndoe
typedef struct Node
{
int data;
struct Node* next;
}Node, *PNode;
头插法插入结点:
1.建立头结点,并分配空间
2.建立新结点,新节点->next指向上一个节点,头结点->next指向新结点
PNode List_HeadInsert(PNode &head)
{
head = (Node*)malloc(sizeof(Node)); //head node
if (!head) /* 检查指标 */
{
printf("failure! \n");
exit(1);
}
PNode new_node;
head->next = NULL; // initialize head node
int qon;
cout << "please enter the quantity of numbers:";
cin >> qon;
for (int i = 0; i < qon; i++)
{
cout << "please enter a number:" ;
int x;
cin >> x;
new_node = (Node*)malloc(sizeof(Node));
if (!new_node) /* 检查指标 */
{