Singly Linked
← Back to Linked Lists
Each node stores data and a pointer to the next node. Can only traverse forward. Simpler and uses less memory per node than doubly linked.
← Back to Linked Lists
Each node stores data and a pointer to the next node. Can only traverse forward. Simpler and uses less memory per node than doubly linked.