- Strength to Increase Rep
- +2
- Strength to Decrease Rep
- -0
[CODE]#include <iostream> #include<string> using namespace std; long int NN; int x=0; class node *temp, *temp2 ,*start; class linked_list { public: class node { public: char name[20]; long int national_number; char residance[25]; node *nxt; }; //---------------------------------> linked_list() { node *start; start=new node; cout<<"NAME : Hussam Adel Abu Lubbad"<<endl; cout<<"nathiona number : … |
|
[code=c++] #include <iostream> #include <string> #include <cmath> #include <cstring> #include <cctype> using namespace std; class link { struct employee { int x; employee *next; } void insert() { employee *temp; temp=new employee; employee *first; first=new employee; if(first=NULL) { employee *tmep; temp=new employee; temp=first; cin>>first->x; first->next=NULL; } else { temp=first; first=temp; … |
|
[CODE][/CODE]// i need a linked list that can do those functions //-------->>> insert , delete ,search ,check if empty ,print <<<----------- // plzzzzzzzzzz i can't inderstanund //i did understand the insert functoin but the other not :'( [CODE]#include <iostream> using namespace std; class link { public: struct employee { int … |