PROGRAM TO IMPLEMENT THE TREE TRAVERSELS.

PROGRAM TO IMPLEMENT THE TREE TRAVERSELS.

  1:16 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class B_Tree; class Node { private:     int Info;     Node *Left, *Right;     friend class B_Tree; }; class B_Tree { private:     Node *Root; public:     B_Tree()     {         Root = NULL;     }  ...

Read More

PROGRAM TO IMPLEMENT THE DOUBLY LINKLIST.

PROGRAM TO IMPLEMENT THE DOUBLY LINKLIST.

  1:13 PM    Unknown

---

#include <iostream> #include <stdlib.h> #include <conio.h> using namespace std; class Double_LL; class Node { private:     int Info;     Node *Left, *Right;     friend class Double_LL; }; class Double_LL { private:     Node *First; public:     Double_LL()     {         First = NULL;    ...

Read More

PROGRAM TO IMPLEMENT THE JOSEPHUS PROBLEM.

PROGRAM TO IMPLEMENT THE JOSEPHUS PROBLEM.

  1:11 PM    Unknown

---

#include <iostream> #include <stdlib.h> #include <string.h> #include <conio.h> using namespace std; class C_List; class Node {     friend class C_List;     friend class Josephus; private:     char Name[100];     Node *Link; }; class Josephus; class C_List {     friend class Josephus; private:     Node *Last; public:  ...

Read More

PROGRAM TO IMPLEMENT STACK USING CIRCULAR LIST.

PROGRAM TO IMPLEMENT STACK USING CIRCULAR LIST.

  1:09 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class Stack; class Node { private: int Info; Node *Link; friend class Stack; }; class Stack { private: Node *Last; public: Stack() { Last = NULL; } void Push(int Value) { Node *Temp = new Node; Temp->Info = Value; if (IsEmpty()) Last = Temp; else Temp->Link =...

Read More

PROGRAM TO IMPLEMENT QUEUE USING CIRCULAR LIST.

PROGRAM TO IMPLEMENT QUEUE USING CIRCULAR LIST.

  1:08 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class Queue; class Node { private: int Info; Node *Link; friend class Queue; }; class Queue { private: Node *Last; public: Queue() { Last = NULL; } void EnQueue(int Value) { Node *Temp = new Node; Temp->Info = Value; if (IsEmpty()) Last = Temp; else Temp->Link...

Read More

PROGRAM TO IMPLEMENT CIRCULAR LISTS(function del after).

PROGRAM TO IMPLEMENT CIRCULAR LISTS(function del after).

  1:07 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class C_List; class Node { private: int Info; Node *Link; friend class C_List; }; class C_List { private: Node *Last; public: C_List() { Last = NULL; } void Insert(int Value) { Node *Temp = new Node; Temp->Info = Value; if (IsEmpty()) Last = Temp; else Temp->Link...

Read More

PROGRAM TO IMPLEMENT CIRCULAR LIST.

PROGRAM TO IMPLEMENT CIRCULAR LIST.

  1:02 PM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class C_List; class Node { private: int Info; Node *Link; friend class C_List; }; class C_List { private: Node *Last; public: C_List() { Last = NULL; } void Insert(int Value) { Node *Temp = new Node; Temp->Info = Value; if (IsEmpty()) Last = Temp; else Temp->Link...

Read More

PROGRAM TO CONCATENATE TWO LISTS TO 3rd

PROGRAM TO CONCATENATE TWO LISTS TO 3rd

  9:17 AM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class Chain; class Node { private:     int Info;     Node *Link;     friend class Chain; }; class Chain { private:     Node *First; public:     Chain()     {         First = NULL;     }     void...

Read More

PROGRAM INSERT A NODE AT END OF LINK LIST.

PROGRAM INSERT A NODE AT END OF LINK LIST.

  9:16 AM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class Chain; class Node { private:     int Info;     Node *Link;     friend class Chain; }; class Chain { private:     Node *First; public:     Chain()     {         First = NULL;     }     void...

Read More

PROGRAM TO MERGE TWO LISTS.

PROGRAM TO MERGE TWO LISTS.

  9:15 AM    Unknown

---

#include <iostream> #include <conio.h> #include <stdlib.h> using namespace std; class Chain; class Node { private:     int Info;     Node *Link;     friend class Chain; }; class Chain { private:     Node *First; public:     Chain()     {         First = NULL;     }     void...

Read More