Current Perl documentation can be found at
Here is our local, out-dated (pre-5.6) version:
In general, you usually don't need a linked list in Perl, since with regular arrays, you can push and pop or shift and unshift at either end, or you can use splice to add and/or remove arbitrary number of elements at arbitrary points. Both pop and shift are both
O(1) operations on perl's dynamic arrays. In the absence of shifts and pops, push in general needs to reallocate on the order every
log(N) times, and unshift will need to copy pointers each time.
If you really, really wanted, you could use structures as described in
the perldsc manpage or the perltoot manpage and do just what the algorithm book tells you to do.