---
title: "Linked Lists in SuperBASIC"
type: "article"
slug: "linked-lists-in-superbasic"
url: "http://localhost/article/linked-lists-in-superbasic/"
markdown_url: "http://localhost/article/linked-lists-in-superbasic.md"
published_at: "2026-03-15T00:02:35+00:00"
modified_at: "2026-03-15T00:02:36+00:00"
featured_image:
  url: "http://localhost/wp-content/uploads/2022/04/20230809-041332.jpg"
excerpt: "Tutorial explaining linked list data structures for QL SuperBASIC programmers. Covers the concept of pointer-based dynamic ordering, where records store pointers to the next item rather than maintaining physical sort order. Includes a working type-in program demonstrating insertion (handling empty list, front insertion, end insertion, and mid-list insertion) and sorted printout."
category:
  - name: "Timelinez"
    slug: "timelinez"
    taxonomy: "category"
    url: "http://localhost/category/periodicals/timelinez/"
post_tag:
  - name: "QL"
    slug: "ql"
    taxonomy: "post_tag"
    url: "http://localhost/tag/ql/"
  - name: "Superbasic (programming language)"
    slug: "superbasic-programming-language"
    taxonomy: "post_tag"
    url: "http://localhost/tag/superbasic-programming-language/"
  - name: "Type-in program"
    slug: "type-in-program"
    taxonomy: "post_tag"
    url: "http://localhost/tag/type-in-program/"
model:
  - name: "Sinclair QL"
    slug: "sinclair-ql"
    taxonomy: "model"
    url: "http://localhost/model/sinclair-ql/"
indiv:
  - name: "Tim Swenson"
    slug: "tim-swenson"
    taxonomy: "indiv"
    url: "http://localhost/indiv/tim-swenson/"
publication_r:
  id: 21571
  title: "Timelinez"
  type: "periodical"
  url: "http://localhost/periodical/timelinez/"
authors_r:
  - name: "Tim Swenson"
    slug: "tim-swenson"
    taxonomy: "indiv"
    url: "http://localhost/indiv/tim-swenson/"
volume: "6"
issue: "12"
issues_articles:
  - id: 38863
    title: "Timelinez v6 n12"
    type: "issue"
    url: "http://localhost/issue/timelinez-v6-n12/"
pages: "9"
pubdate: "December 1988"
archive_link: false
---

Tutorial explaining linked list data structures for QL SuperBASIC programmers. Covers the concept of pointer-based dynamic ordering, where records store pointers to the next item rather than maintaining physical sort order. Includes a working type-in program demonstrating insertion (handling empty list, front insertion, end insertion, and mid-list insertion) and sorted printout.