#import "@local/note_template:0.0.1": *

#set par(justify: true)
#set heading(numbering: "1.1")
#set page(numbering: "1", number-align: center)

#frontmatter(
  title: "Chapter 3: Data Sturctures",
  date: "2023 Oct 31",
  authors: ("Nemo",)
  )

#outline(indent: auto)
#pagebreak()

= Elementary Data Sturctures

== Stacks and Queues

Stacks and queues are dynamic sets in which the element removed form the set by the "Delete" operation prespecified. Stacks follow the _last-in, first-out_ or _LIFO_ policy and the queues follow the _first-in, first-out_ policy.

=== Stacks

The INSERT operation on a stack is often called PUSH, and the DELETE is called POP (allusions to physical stacks).

*Skipped...*
=== Queues 

The INSERT operation is called ENQUEUE and the DELETE is called DEQUEUE. The queue has a _head_ and a _tali_.

*Skipped...*

=== Lots of Skipping ...

= Hash Tables
