Stack Queue Data Structure

Stack :

In the Stack Data structure we follow the LIFO Principle.
( Last In Fisrt Out )
In stack we have TOP Pointer.
If Stack is empty then the TOP points to -1.
Operations on the Stack: a. Push(parameter) b. Pop c. Peek d. isFull() e. isEmpty()

Queue:

In the Queue Data structure we follow the FIFO Principle.
( First In Fisrt Out )
In Queue we have FRONT, REAR Pointer.
If Queue is empty then the TOP points to -1.
Here, we delete the element from the FRONT And Inserting of an Element from REAR end.
Operations on the Queue: a. Enqueue(parameter) b. Dequeue() c. Peek() d. isFull() e. isEmpty()

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.cph		.cph
.vscode		.vscode
Queue_implementation.cpp		Queue_implementation.cpp
Queue_implementation.exe		Queue_implementation.exe
Queue_using_linked_list.cpp		Queue_using_linked_list.cpp
Queue_using_linked_list.exe		Queue_using_linked_list.exe
README.md		README.md
Stack_using_Linked_list.cpp		Stack_using_Linked_list.cpp
Stack_using_Linked_list.exe		Stack_using_Linked_list.exe
cir_queue_using_array.c		cir_queue_using_array.c
cir_queue_using_array.exe		cir_queue_using_array.exe
circular_queue.c		circular_queue.c
circular_queue.cpp		circular_queue.cpp
circular_queue.exe		circular_queue.exe
ex09.c		ex09.c
queue_01.cpp		queue_01.cpp
queue_01.exe		queue_01.exe
queue_02.cpp		queue_02.cpp
queue_02.exe		queue_02.exe
queue_in_c_practice.c		queue_in_c_practice.c
queue_in_c_practice.exe		queue_in_c_practice.exe
stack_01.cpp		stack_01.cpp
stack_01.exe		stack_01.exe
stack_02.cpp		stack_02.cpp
stack_02.exe		stack_02.exe
stack_03.cpp		stack_03.cpp
stack_03.exe		stack_03.exe
stack_04.cpp		stack_04.cpp
stack_04.exe		stack_04.exe
stack_05.cpp		stack_05.cpp
stack_05.exe		stack_05.exe
stack_practice.cpp		stack_practice.cpp
stack_practice.exe		stack_practice.exe

Provide feedback