Important problems in datastructure is available in this repository. 1)Different insertion and deletion function in linkedlist(singly_linkedlist, circular_linkedlist, doubly_linkedlist) 2)Implementation and basic functionalitis of stack(using array and linkedlist). 3)Implementation and basic funcionalitis of queue (using array and linkedlist). Basic functionalitis are push(), pop(), peek(), isFull() and isEmpty().
tapati-chakraborty/Data_Structure_using_C
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|