How to resolve the algorithm Singly-linked list/Traversal step by step in the BASIC programming language

Published on 12 May 2024 09:40 PM
#Basic

How to resolve the algorithm Singly-linked list/Traversal step by step in the BASIC programming language

Table of Contents

Problem Statement

Traverse from the beginning of a singly-linked list to the end.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Singly-linked list/Traversal step by step in the BASIC programming language

Source code in the basic programming language

      DIM node{pNext%, iData%}
      DIM a{} = node{}, b{} = node{}, c{} = node{}
      
      a.pNext% = b{}
      a.iData% = 123
      b.iData% = 789
      c.iData% = 456
      
      PROCinsert(a{}, c{})
      
      PRINT "Traverse list:"
      pnode% = a{}
      REPEAT
        !(^node{}+4) = pnode%
        PRINT node.iData%
        pnode% = node.pNext%
      UNTIL pnode% = 0
      
      END
      
      DEF PROCinsert(here{}, new{})
      new.pNext% = here.pNext%
      here.pNext% = new{}
      ENDPROC

You may also check:How to resolve the algorithm Fibonacci word/fractal step by step in the Quackery programming language
You may also check:How to resolve the algorithm Sorting algorithms/Pancake sort step by step in the Python programming language
You may also check:How to resolve the algorithm Compile-time calculation step by step in the Rust programming language
You may also check:How to resolve the algorithm SHA-1 step by step in the Ada programming language
You may also check:How to resolve the algorithm Sort three variables step by step in the FALSE programming language