#python #sicp
A linked list is a pair containing the first element of the sequence (in this
case 1) and the rest of the sequence (in this case a representation of 2, 3,
4). The second element is also a linked list. The rest of the inner-most
linked list containing only 4 is 'empty' , a value that represents an empty
linked list.
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open itA linked list is a pair containing the first element of the sequence (in this
case 1) and the rest of the sequence (in this case a representation of 2, 3,
4). The second element is also a linked list. The rest of the inner-most
linked list containing only 4 is 'empty' , a value that represents an empty
linked list.
Linked lists have recursive structure: the rest of a linked list is a linked
list or 'empty' . We can define an abstract data representation to validate,
construct, and select the comSummary
status | not read | | reprioritisations | |
---|
last reprioritisation on | | | suggested re-reading day | |
---|
started reading on | | | finished reading on | |
---|
Details