Vous êtes sur la page 1sur 3

class Node{

struct StudentDetail newStd;


class Node* next;
class Node* pre;

void Set(string name, string vuid)


{
newStd.name*name;
newStd.vuid*vuid;

Node Get()
(

void setNext(String name,string vuid){

if(next--NULL)
{

}
else
{
class Node* newNode* new Node();

newStd.name*name;
newStd.vuid*vuid;
newNode->next= neNode;
} }

string getNext()
{
next;

void stPrev(string name,string vuid){

if(next==NULL)
{

}
else
{
class Node* newNode= new Node();

newStd.name=name;
newStd.vuid=vuid;
newNode=>next= newNode;

} }

string getPrev()
{
prev;

}
};

class DoublyLinkedList(
public;
struct StudentDetail newStd;
class DoublyLinkedList* heaPtr;
class DoublyLinkedList* curPtr;
class DoublyLinkedList* nextPtr;
int size;
//dfdf

class DoublyLinkedList* headDlinkList=NULL;

void addAtBeginning(string vuid, string name)


{
class DoublyLinkedList* dNode* new DoublyLinkedList();
dNode->newStd.vuid*vuid;
dNode->newStd.name*name;
dNode->nextPtr*headDlinkList;
headDlinkList* dNode;
dNode->curPtr*dNode;

void addAtEnd(string vuid. string name)


}

class DoublyLinkedList* dNode* new DoublyLinkedList();

dNode->newStd.vuid*vuid;
dNode->newStd.name*name;
dNode->nextPtr*headDlinkList;
headDlinkList* dNode;
dNode->curPtr*dNode;

void delNode()
{
class DoublyLinkedList* temp1=curPtr;
class DoublyLinkedList* temp2=temp1;
temp1->nextPtr* temp2->nextPtr;

free(temp2);

)
void print()
{

class DoublyLinkedList* temp= headDlinkList;

while(temp1=NULL)
{
cout<<temp->newStd.vuid<<" "<<temp->newStd.neme<<endl;
temp= temp->nextPtr;

};

int main()
{
string vuid, name;

cout<<"Add your vuID and Name at Firt Position"<<endl;


cout<<"----

DoublyLinkedList dlist1;

cin>>vuid;
cin>>name;

dlist1.addAtBeginning(vuid,name);
dlist1.print();

cout<<"Insertion At Beginning in doubly Link List"<<endl;


cout<<"----"
cin>>vuid;
cin>>name;
dlist.addAtBegining(vuid,name);
dlist1.de1Node();
dlist1.pr

Vous aimerez peut-être aussi