Malenaadu
DataStructure Program to convert an Infix expression to Prefix form.
›
#include <stdio.h> #include <conio.h> #include <string.h> #include <ctype.h> #define MAX 50 struct infix ...
DataStructure Program to merge two 1-D arrays
›
#include <stdio.h> #include <conio.h> #include <alloc.h> #define MAX1 5 #define MAX2 7 int *arr ; int* create ( ...
DataStructure-Program to merge two linked list
›
#include <stdio.h> #include <conio.h> #include <alloc.h> /* structure containing a data part and link part */ s...
DataStructure Program to maintain an AVL tree
›
#include <stdio.h> #include <conio.h> #include <alloc.h> #define FALSE 0 #define TRUE 1 struct AVLNode { int data...
DataStructure Program to maintain a threaded binary tree
›
#include <stdio.h> #include <conio.h> #include <alloc.h> enum boolean { false = 0, true = 1 } ; struct thtree {...
DataStructure Program to implement a circular queue as a linked list
›
DataStructure-Program to implement a circular queue as a linked list. #include <stdio.h> #include <conio.h> #include <a...
DataStructure Program to maintain a double linked list
›
#include <stdio.h> #include <conio.h> #include <alloc.h> /* structure representing a node of the doubly linked list *...
›
Home
View web version