Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("text.in");
- struct nod
- {
- int info;
- nod*leg;
- };
- nod* creare(int n)
- {
- nod *prim, *p, *q;
- prim=new nod;
- q=prim;
- cout<<"Introduceti informatia din nodul 1 : ";
- f>>prim->info;
- for(int i=2; i<=n; i++)
- {
- p=new nod;;
- cout<<"Introduceti informatia din nodul "<<i<<" : ";
- f>>p->info;
- q->leg=p;
- q=p;
- }
- p->leg=NULL;
- return prim;
- }
- void parcurgere(nod *prim)
- {
- nod*p;
- p=prim;
- while(p)
- {
- cout<<p->info<<" ";
- p=p->leg;
- }
- }
- int main()
- {
- nod *prim;
- int n;
- cout<<"Cate elemente are lista? "; f>>n;
- prim=creare(n);
- parcurgere(prim);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement