Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "Lista.h"
- #include <iostream>
- using namespace std;
- Lista::Lista()
- {
- First = 0;
- }
- Lista::~Lista()
- {
- }
- Node::Node()
- {
- Next = 0;
- }
- void Lista::Insert(int k)
- {
- if (First == 0)
- {
- First = new Node;
- First->key = k;
- }
- else
- {
- Node * Tmp = First;
- while (Tmp->Next)
- {
- Tmp = Tmp->Next;
- }
- Tmp->Next = new Node;
- Tmp->Next->key = k;
- Tmp->Next->Next = 0;
- }
- }
- void Lista::Print()
- {
- Node * Tmp = First;
- while (Tmp)
- {
- cout << Tmp->key << endl;
- Tmp = Tmp->Next;
- }
- }
- Node * Lista::Search(int k)
- {
- Node * Tmp = First;
- while (Tmp)
- {
- if (Tmp->key == k)
- {
- cout << "Found! "<< k << endl;
- return Tmp;
- }
- Tmp = Tmp->Next;
- }
- cout << "Not Found!" << endl;
- }
- void Lista::Delete(int k)
- {
- if (First->key == k)
- {
- Node * Tmp = First;
- First = First->Next;
- delete Tmp;
- }
- else
- {
- Node * Tmp = First;
- while (Tmp->Next)
- {
- if (Tmp->key == k-1)
- {
- //Tmp->Next = Tmp->Next->Next;
- Tmp = Tmp->Next;
- return;
- }
- Tmp = Tmp->Next;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement