Liân-kiat list

Liân-kiat list ("* lih-sir-toh" Eng-gí: linked list) sī chi̍t khoán data kò͘-chō, bu̍t-kiāⁿ sī í ti̍t-chōa ê sūn-sī pâi-lia̍t. List ê sūn-sī sī koat-tēng tī ta̍k hāng bu̍t-kiāⁿ téng-bīn ê chi̍t-ê pointer.

A linked list whose nodes contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the list.

Chham-khó

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein (2009). Introduction to Algorithms (Tē-3 pán.). The MIT Press. p. 236. ISBN 9780262259460. CS1 pó-ióng: Ēng authors chham-sò͘ (link)