Liân-kiat list

Liân-kiat lì-sṳh-thoh (Hàn-jī: 連結 lì-sṳh-thoh; Eng-gí: linked list) ia̍h Liân-kiat chhoàn-lia̍t (連結串列), sī chi̍t khoán chu-liāu kò͘-chō, bu̍t-kiāⁿ sī í ti̍t-chōa ê sūn-sī pâi-lia̍t. Lì-sṳh-thoh ê sūn-sī sī koat-tēng tī ta̍k hāng bu̍t-kiāⁿ téng-bīn ê chi̍t-ê chí-piau (pointer).

1-ê ta̍k chiat-tiám (node) lóng pau-hâm nn̄g-ê nôa-ūi ê liân-kiat lì-sṳh-thoh: 1-ê chéng-sò͘ ê ta̍t kah chí khì āu-chi̍t-ê chiat-tiám ê liân-kiat. Siāng-bóe chi̍t-ê chiat-tiám chí khì 1-ê tāi-piáu lì-sṳh-thoh kiat-sok ê hû-hō.

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.

Pún bûn-chiuⁿ sī chi̍t phiⁿ phí-á-kiáⁿ. Lí thang tàu khok-chhiong lâi pang-chō͘ Wikipedia.