Data Structures

Printing in a Singly and Doubly Linked List

Free linked list and also doubly linked list

Insert at the beginning for a Singly Linked List

Removing the first node in a Singly Linked List

Insert at any position

Reversing the Singly Linked List

Reversing a Singly Linked List with Recursion

Print the doubly linked list in reverse

Insert at the beginning for Doubly linked list

Keep in mind the create node in here and also the other ones basically allocates the memory for the node and sets both the prev and the next to nullptr

Deleting any node from a Doubly Linked List

Circular Linked List Append

Printing a Circular Linked List

Deleting the Circular Linked List

Size of a Circular Linked List

Printing a permutation in a Circular Linked List

Emptying the stack and printing it

Check if stack is empty

Pushing on to a Stack array based

Popping int a stack

This is how you print a binary numbered with recursion

Enqueue

Printq

Dequeue

Doubly linked list with sentinels - List Search

List Insert

List Delete

Enqueue Array Implementation

Dequeue