Data structure and Algorithm
تفاصيل العمل
A queue is a data structure that follows the First In, First Out (FIFO) principle. Elements are added to the rear and removed from the front. Basic operations include `enqueue` (adding), `dequeue` (removing), `peek` (viewing the front element), and `is Empty` (checking if it's empty). It can be implemented using arrays or linked lists and is used in scenarios like task scheduling and buffering.
بطاقة العمل
طلب عمل مماثل
