algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-28 04:33:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

seo: add social image

Browse Source
This commit is contained in:
Yangshun Tay
2022-05-11 10:18:34 +08:00
parent 5e137e236d
commit 75c75293b1
70 changed files with 138 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
contents/algorithms/queue.md
View File

@ -15,6 +15,10 @@ sidebar_label: Queue
toc_max_heading_level: 2
---
<head>
<meta property="og:image" content="https://www.techinterviewhandbook.org/social/algorithms/algorithms/algorithms-queue.png" />
</head>
## Introduction
A queue is a linear collection of elements that are maintained in a sequence and can be modified by the addition of elements at one end of the sequence (**enqueue** operation) and the removal of elements from the other end (**dequeue** operation). Usually, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue. As an abstract data type, queues can be implemented using arrays or singly linked lists.