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



See also

 Array
 Associative array: Creation, Iteration
 Collections
 Compound data type
 Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal
 Linked list
 Queue: Definition, Usage
 Set
 Singly-linked list: Element definition, Element insertion, List Traversal, Element Removal
 Stack


11101000000000100000000000000000   0. -23 to c
10011000000000010000000000000000   1. Sub. 25
10010000000001100000000000000000   2. c to 9
10101000000000010000000000000000   3. Sub. 21
11010000000001100000000000000000   4. c to 11
10010000000000100000000000000000   5. -9 to c
10010000000001100000000000000000   6. c to 9
11010000000000100000000000000000   7. -11 to c
11010000000001100000000000000000   8. c to 11
00000000000000000000000000000000   9. to be generated at run time
00101000000001100000000000000000  10. c to 20
00000000000000000000000000000000  11. to be generated at run time
00000000000000110000000000000000  12. Test
00011000000000000000000000000000  13. 24 to CI
10011000000001100000000000000000  14. c to 25
10011000000000100000000000000000  15. -25 to c
10011000000001100000000000000000  16. c to 25
01101000000000000000000000000000  17. 22 to CI
00101000000000100000000000000000  18. -20 to c
00000000000001110000000000000000  19. Stop
00000000000000000000000000000000  20. variable: negation of car
10000000000000000000000000000000  21. constant 1
11111111111111111111111111111111  22. constant -1
00000000000000100000000000000000  23. -0 to c
10001000000000000000000000000000  24. constant 17 (jump target)
00111000000000000000000000000000  25. 28 (pointer variable)
01000000000000000000000000000000  26. 2
01111000000000000000000000000000  27. pointer: 30
10000000000000000000000000000000  28. 1
01011000000000000000000000000000  29. pointer: 26
11000000000000000000000000000000  30. 3
00000000000000000000000000000000  31. 0 (nil)