}
+void node_sl_destroy( node_sl **node_ppt )
+{
+ /* Martin A. Hansen, September 2008 */
+
+ /* Free memory for singly linked list node and value. */
+
+ node_sl *node = *node_ppt;
+
+ mem_free( &node->val );
+ mem_free( &node );
+
+ *node_ppt = NULL;
+}
+
+
/* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> DOUBLY LINKED LIST <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<*/
}
+void node_dl_destroy( node_dl **node_ppt )
+{
+ /* Martin A. Hansen, September 2008 */
+
+ /* Free memory for doubly linked list node and value. */
+
+ node_dl *node = *node_ppt;
+
+ mem_free( &node->val );
+ mem_free( &node );
+
+ *node_ppt = NULL;
+}
+
+
/* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> GENERIC LINKED LIST <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<*/