CS1152 - Data Structures Laboratory Programs | C Programs

Here are the data Structures laboratory programs in C. IMPLEMENTATION OF LIST ADT USING LINKED LIST IMPLEMENTATION OF LIST ADT USING A...

QUICK SORT

SOURCE CODE: “Quick.h” File: #include<stdio.h> #include<conio.h> #define cutoff (3) void swap(int *x,int *y) {    int ...

HEAP SORT

SOURCE CODE: “Heap.h” File: #include<stdio.h> #include<conio.h> #define leftchild(i) (2*i+1) void swap(int *x,int *y) ...

SEARCH TREE ADT - BINARY SEARCH TREE

SOURCE CODE: “Tree.h” File: #include<stdio.h> #include<stdlib.h> #include<conio.h> struct node {    int data;  ...

APPLICATION OF STACK ADT – CONVERSION OF INFIX TO POSTFIX EXPRESSION

SOURCE CODE: “Iexp.h” File: #include<stdio.h> #include<conio.h> #include<alloc.h> #define MAX 10 struct stack { ...