C Program for implementing two Stacks on Single Array.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 10 /* Size of Stack */
int s[SIZE],top[3]={0,-1,SIZE};
/* Global […]

C Program for Simple DSC order Priority QUEUE Implementation using Structure.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Queue */
int f=0,r=-1; /* […]

C Program for Simple DSC order Priority QUEUE Implementation using Structure.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT.

#define SIZE 5 /* Size of Queue */
int f=0,r=-1; […]

C Program for Simple ASC order Priority QUEUE Implementation using Structure.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Queue */
int f=0,r=-1; /* […]

C Program for Simple DSC order Priority QUEUE Implementation.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Queue */
int PQ[SIZE],f=0,r=-1; /* Global […]

C Program for Simple ASC order Priority QUEUE Implementation.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Queue */
int PQ[SIZE],f=0,r=-1; /* Global […]

C Program to convert Prefix Expression into Postfix .
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
#include
char opnds[50][80],oprs[50];
int topr=-1,topd=-1;
pushd(char […]

C Program to convert Prefix Expression into INFIX.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
#include
char opnds[50][80],oprs[50];
int topr=-1,topd=-1;
pushd(char […]

C Program for Infix to Prefix Conversion.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 50 /* Size of Stack */
#include
#include
char s[SIZE];
int top=-1; /* […]

C Program for Binary Search and Towers of Hanoi using Recursion.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

main()
{
int n,a[50],key,opn,i,pos;
do
{
clrscr();
[…]

C Program for Binary Search Tree Creation and Traversals.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
typedef struct tnode
{
int data;
struct tnode […]

Program for Doubly Linked List Operations – Insert (Front, Before), Delete, Display
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
typedef struct dnode
{
int data;
struct […]

C Program to implement QUEUE operations using Linked Lists
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
typedef struct node
{
int data;
struct node *link;
}NODE;

void […]

C Program to implement STACK operations using Linked Lists.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
typedef struct node
{
int data;
struct node *link;
}NODE;

void […]

C Program for Singly Linked List Operations – Insert (Front, Pos, back), Delete, Search and Update.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include
#include
typedef struct node
{
[…]

Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Circular Queue */
int CQ[SIZE],f=-1,r=-1; /* Global declarations */

CQinsert(int elem)
{ […]

Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Queue */
int Q[SIZE],f=0,r=-1; /* Global declarations */

Qinsert(int elem)
{ /* […]

Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 50 /* Size of Stack */
#include
int s[SIZE];
int top=-1; /* Global declarations */

push(int elem)
{ […]

Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 50 /* Size of Stack */
#include
char s[SIZE];
int top=-1; /* Global declarations */

push(char elem)
{ […]

Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#define SIZE 5 /* Size of Stack */
int s[SIZE],top=-1; /* Global declarations */

push(int elem)
{ /* […]