DFS :: PRIORITY

#include<stdio.h> #include<process.h> struct node { struct node *llink; int data; int priority; struct node *rlink; }; void insert(); void remove(); […]

Share

DFS :: Selection

#include<stdio.h> void main() { int *iptr,size,k,temp; ankur: printf(“Enter the size of the array:”); scanf(“%d”,&size); if(size<1) { printf(“Invalid Size\nTry Again!!!!!\n”); goto […]

Share

DFS :: Searching

#include<stdio.h> void main() { int *iptr,size,key,flag=-1; ankur: printf(“Enter the size of the array”); scanf(“%d”,&size); if(size<1) { printf(“Invalid Size\nTry Again!!!!!\n”); goto […]

Share

Traverse

#include<stdio.h> #include<process.h> #include<malloc.h> typedef struct binarytree { struct binarytree *lp; int key; struct binarytree *rp; }NODE; NODE* insert(NODE *,int); void […]

Share

Write a program to enter a sparse matrix and display it (the sparse matrix must be stored in vector form)

/* PROGRAM: ——– Write a program to enter a sparse matrix and display it (the sparse matrix must be stored […]

Share

Write a program to Transpose an array of 4*4

/* PROGRAM: ——– Write a program to Transpose an array of 4*4. */ #include<stdio.h> #include<conio.h> void main() { int a[4][4],t[4][4],i,j; […]

Share