Stack Operations

#include<stdio.h> #include<stdlib.h> #define maxsize 50 void push(); int pop(); void display(); int stack[maxsize]; int top=-1; ma…

Postfix Evaluation

#include<stdio.h> #define Maxsize 20 void push(int num); int pop(); int top=-1; int stack [Maxsize]; void main() {     char exp[50]…

Infix to Postfix Conversion

#include<stdio.h> #include<ctype.h> #include<stdlib.h> #define MAXSIZE 20 void push(char x); char pop(); int priority(char ch)…

Maximum Element in an array

#include<stdio.h> int Max(int arr[20], int n); void main() { int arr[20], n, i, x; printf("Enter the size of the array: ");…

GCD using Recursion

#include<stdio.h> #include<stdlib.h> int GCD(int a, int b); void main() { int a, b; printf("Enter any two positive integer…

Singly Linked List

Circular Queue

#include<stdio.h> #include<stdlib.h> #define maxsize 10 void enqueue(); int dequeue(); void display(); int queue[maxsize]; int rear…

Addition Of Polynomials

#include<stdio.h> #include<conio.h> #include<stdlib.h> struct poly { double coef; int exp; struct poly * link; }; typede…

Recursive Merge Sort

#include <stdio.h> void merge(int a[], int start, int mid, int end); void mergesort(int a[], int start, int end); main() { int a[100], …

Binary Search Tree Traversals

#include <stdio.h> #include <stdlib.h> struct node { int item; struct node * left; struct node * right; }; typedef struct node * …