Graph

#include<stdio.h>
int main(){
    int i, j, node, test, cn1, cn2;
    int a[100][100];
    printf("Number of Nodes: ");
    scanf("%d",&node);

Swap Two Number

/* Using C */

#include<stdio.h>

int main(){

    int a, b, x;

    printf("Value of A: ");

Print "Hello World" Using if-else Condition.

/* Here "Hello World!" is printed using if-else condition. "Hello" printed in if condition and "World" printed in else condition. */


/* Using C */
#include<stdio.h>

Linked List in C

/* We can't call insert last or insert any function when our linked list is empty. So if there is no data in our linked list and we want to use insert last or insert any function then we called insert first function there. Again if we have one data in our linked list and we want to use delete the last function, then we called delete the first function */

#include<stdio.h>
#include<stdlib.h>

Queue in C

#include<stdio.h>
#include<stdlib.h>

/*Node*/
struct Node{
    int data;

Stack in C

#include<stdio.h>
#include<stdlib.h>

/*Node*/
struct Node{
    int data;

Stack in C (Advanced)

/* Here we create two stack. First we push some data in our first stack. Then if we pop any data from our first stack that will be pushed in our second stack. So we will not lose any data. There are two different display function for two different stack. */

#include <stdio.h>
#include <stdlib.h>