Apexe3rdsem Data structure😍😍

cool🙌

.SINGLY .DOUBLY .CIRCULAR

.BY USING ARRAY .BY USING LINKED LIST .DOUBLE STACK IMPLEMENTATION

.INFIX .PREFIX .POSTFIX

.BY USING ARRAY .BY USING LINKED LIST .LINEAR

.Binary tree .complete Binary tree .Bill search .Threaded Bill search

.Inorder .preorder .post order

.B-Tree

.types of graph .memory representation of graph .travesing of graph .minimum spannig Tree

.sequential search .Binary search

.Bubble sort .Heap sort .quick sort .insertation sort .merge sort

Name		Name	Last commit message	Last commit date
Latest commit History 60 Commits
D-queue.c		D-queue.c
Double queue.c		Double queue.c
LINKED LIST		LINKED LIST
Queue implement by linked list.c		Queue implement by linked list.c
README.md		README.md
Stack		Stack
USING ARRAY IMPLEMENTATION STACK.C		USING ARRAY IMPLEMENTATION STACK.C
circular queue.c		circular queue.c
double q.c		double q.c
function for delete node.c		function for delete node.c
function for display node.c		function for display node.c
function for insertnode.c		function for insertnode.c
function of usnig Array pop push display in stack.c		function of usnig Array pop push display in stack.c
funtion for double delete node.c		funtion for double delete node.c
implement binary search tree.c		implement binary search tree.c
implement single linked list.cpp		implement single linked list.cpp
implement stack using linked list.c		implement stack using linked list.c
implementation of queue.c		implementation of queue.c
implemwnt double linkedlist.c		implemwnt double linkedlist.c
stack double function implementation.c		stack double function implementation.c
stack for double implementation.c		stack for double implementation.c