Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void InserareInainteQ(nod *&prim, nod *&ultim, nod *q,int x)
- {
- nod *nou=new nod;
- nou->info=x;
- if(q==prim)
- {
- q->ant=nou;
- nou->pre=q;
- nou->ant=0;
- prim=nou;
- }
- else
- {
- nou->pre=q;
- nou->ant=q->ant;
- q->ant->pre=nou;
- q->ant=nou;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement