Showing posts with the label data structureShow all
Binary search tree
data structure

Binary search tree

Apurba Khanra December 08, 2019

#include<stdio.h> #include<conio.h> #include<stdlib.h> struct node { int data; struct node *left; struct node *right; }; voi…

double ended queqe implementation
data structure

double ended queqe implementation

Apurba Khanra December 08, 2019

#include<stdio.h> #include<conio.h> #define SIZE 100 void enQueue(int); int deQueueFront(); int deQueueRear(); void enQueueRear(int); voi…

Circular queue
data structure

Circular queue

Apurba Khanra December 08, 2019

#include<stdio.h> #include<conio.h> #define SIZE 10 void enQueue(int); void deQueue(); void display(); int cQueue[SIZE], front = -1, rear…

stack using linked lists
data structure

stack using linked lists

Apurba Khanra November 13, 2019

#include<stdio.h> #include<conio.h> struct Node {    int data;    struct Node *next; }*top = NULL; void push(int); void pop(); void di…

linked list implementation
data structure

linked list implementation

Apurba Khanra November 12, 2019

#include <stdio.h> #include <stdlib.h> struct node {   int data;   struct node *next; }; struct node *start = NULL; void insert_at_begin…

Queue using array
data structure

Queue using array

Apurba Khanra November 12, 2019

#include<stdio.h> #include<conio.h> #define SIZE 10 void enQueue(int); void deQueue(); void display(); int queue[SIZE], front = -1, rear …

Stack using array
data structure

Stack using array

Apurba Khanra November 12, 2019

#include<stdio.h> #define MAX 5 int top = -1; int stack_arr[MAX]; /*Begin of push*/ void push() { int pushed_item; if(top == (MAX-1)) pri…

double linked lists
data structure

double linked lists

Apurba Khanra October 04, 2019

#include<stdio.h> #include<stdlib.h> struct node {     struct node *prev;     struct node *next;     int data; }; struct node *head; voi…

Load More That is All