输入数字,单链表按数字顺序输出

#include<iostream>
using namespace std;
class Node
{
public:
int date;
Node *next;
Node() :next(nullptr) {}
Node(int date) :date(date) {}
void display()
{
cout << date << ' ';
}
};
class Link
{
private:
Node * head;
public:
Link()
{
head = new Node();
}
~Link()
{
while (head != nullptr)
{
Node *p = head->next;
delete(head);
head = p;
}
}
void insert(int date)
{
Node *tail = head;
while (tail->next != nullptr)
{
Node *p = tail->next;
if (date < p->date)
{
break;
}
tail = tail->next;


}
Node *p = new Node();
p->date = date;
p->next = tail->next;
tail->next = p;


}
void traverse()
{
Node *p = head->next;
while (p != nullptr)
{
p->display();
p = p->next;
}
cout << endl;
}




};
int main()
{
Link link; 
link.insert(7);
link.insert(2); 
link.traverse(); 
link.insert(3);
link.traverse(); 
return 0;
}

猜你喜欢

转载自blog.csdn.net/a66666_/article/details/79767292