Tathagat Priyadarshi priyadarshitathagat

## Stack.c
#include <stdio.h>
#include<stdlib.h>
struct node
{
    int val;
    struct node *left;
    struct node *right;
};

struct node* getnode( )

## sort_linked_list.c
//sorting the elements of a linked list by selection sort technique
#include <stdio.h>
#include<stdlib.h>
struct node
{
    int val;
    struct node *link;
};

struct node* getnode( )

## polynomials.c
//addition of polynomials
#include <stdio.h>
#include<stdlib.h>
struct node
{
    int coeff;
    int exp;
    struct node *link;
};

## circular_queue.c
#include<stdio.h>
#include<stdlib.h>
#define max 25

int front=0,rear=-1,c=0; //c to count the number of inputs in the queue
struct stack{
int a;
};


## prefix_evaluation.c
#include<stdio.h>
#include<string.h>
int top=-1; char a[20];
void push(char x)
{
    a[++top]=x;
}
char pop()
{
  return(a[top--]);

## postfix_evaluation.c
#include<stdio.h>
#include<string.h>
int top=-1; char a[20];
void push(char x)
{
    a[++top]=x;
}
char pop()
{
  return(a[top--]);

## String_Combination.c
#include <iostream>
#include <cstring>
#include<cstdio>
using namespace std;
void swap(char*,char*);
void combo(char *, int, int);
void combo(char*);
int main()
{
    char ch[100];

## infix_to_prefix.c
#include<stdio.h>
#define max 100
int top=-1, a[max];
void push(char x)
{
    a[++top]=x;
}
char pop()
{ if(top==-1)
return -1;

## linked_dequeue.c
#include <stdio.h>
#include<stdlib.h>
struct node
{
    int val;
    struct node *link;
};

struct node* getnode( )
{

## linked_queue.c
#include <stdio.h>
#include<stdlib.h>
struct node
{
    int val;
    struct node *link;
};

struct node* getnode( )
{
	#include <stdio.h>
	#include<stdlib.h>
	struct node
	{
	int val;
	struct node *left;
	struct node *right;
	};

	struct node* getnode( )
	//sorting the elements of a linked list by selection sort technique
	#include <stdio.h>
	#include<stdlib.h>
	struct node
	{
	int val;
	struct node *link;
	};

	struct node* getnode( )
	//addition of polynomials
	#include <stdio.h>
	#include<stdlib.h>
	struct node
	{
	int coeff;
	int exp;
	struct node *link;
	};
	#include<stdio.h>
	#include<stdlib.h>
	#define max 25

	int front=0,rear=-1,c=0; //c to count the number of inputs in the queue
	struct stack{
	int a;
	};
	#include<stdio.h>
	#include<string.h>
	int top=-1; char a[20];
	void push(char x)
	{
	a[++top]=x;
	}
	char pop()
	{
	return(a[top--]);
	#include <iostream>
	#include <cstring>
	#include<cstdio>
	using namespace std;
	void swap(char,char);
	void combo(char *, int, int);
	void combo(char*);
	int main()
	{
	char ch[100];
	#include<stdio.h>
	#define max 100
	int top=-1, a[max];
	void push(char x)
	{
	a[++top]=x;
	}
	char pop()
	{ if(top==-1)
	return -1;