Posts by Akash Padhiyar

Queue Using Linkedlist Representation

/* Queue using Linkedlist representation. */ #include<iostream.h> #include<conio.h> #include<PROCESS.h> struct node { int info; node *next; }; class queue { […]

Share

STACK representation of linked-list

/* STACK representation of linkedlist. */ #include<iostream.h> #include<conio.h> #include<PROCESS.h> struct node { int info; node *next; }; class stack { […]

Share

DOUBLY Linked List

/* DOUBLY Linked list. */ #include<iostream.h> #include<conio.h> struct dnode { int info; dnode *prev,*next; }; class Doublylinkedlist { private: dnode […]

Share

Single Linked – List

/* Single LinkedList */ #include<iostream.h> #include<conio.h> #include<stdlib.h> struct node { int info; node *next; }; class Linkedlist { private: node […]

Share

Circular Queue Using Array.

/* Circular Queue using Array. */ #include<stdlib.h> #include<iostream.h> #include<conio.h> class queue { private: int queue_element[5]; int Front,Rear; public: queue(); int […]

Share

Stack Using Array

#include<iostream.h> #include<conio.h> class stack { private: int ele[10]; int top; public: stack();//Constructor void push(int); int pop(); int underflow(); int overflow(); […]

Share