Mutable Singly Linked Lists Part 1 Ocaml Programming Chapter 7 Video 7

A deep dive into implementing

The second

The syntax and semantics of ref cells Textbook: https://cs3110.github.io/textbook.

References, or ref cells, are pointers to typed locations in memory. They enable imperative

The fields of records can be marked as

OCaml

The basics of

References make aliasing a possibility. Changes to

How to implement a Map ADT with association

Examples of pattern matching with

LinkedList data structures and algorithms tutorial example explained #linkedlist #

Defining a persistent stack data structure as an

Continuing the Map interface with conversions to/from

How to implement a Map ADT with association

Formal syntax and semantics of

The semicolon operator is used to sequence imperative commands Textbook: https://cs3110.github.io/textbook.

How to implement queues functionally, and how to improve efficiency by using two

How to define a type for binary trees using variants. Textbook: https://cs3110.github.io/textbook.

In this tutorial, I will show the basic ideas of immutable