#include<iostream>
using namespace std;
typedef struct TNode
{
int data;
struct TNode *next;
}TNode;
TNode* insertNum(TNode* head, int data)
{
TNode *node = new TNode;
node->data = data;
node->next = NULL;
if (head == NULL)
{
return node;
}
if (head->data > data)
{
node->next = head;
return node;
}
TNode* pre = head;
TNode* cur = head->next;
while (cur && cur->data < data)
{
pre = cur;
cur = cur->next;
}
node->next = cur;
pre->next = node;
return head;
}
int main()
{
int num;
TNode* head = NULL;
int A[4] = { 0, 11, 3, 4 };
for (int i = 0; i < 4; i++)
{
head = insertNum(head, A[i]);
}
for (TNode* cur = head; cur!=NULL; cur = cur->next)
cout << cur->data<<endl;
return 0;
}