returning a node of linked list stack overflow

#Returning a node of linked list stack overflow code#

You can use puts or fputs instead of printf to print fixed strings. Or fputs('Deleting all elements. ', stdout)

Use puts or fputs to print fixed strings puts('Deleting all elements.') insert_element, delete_element, destroy_list. Insert, delete and destroy (and other verbs) aren't very descriptive because they're ambiguous on what to. See the next section for a better name for delete. You can use something like new_node to refer to a newly created node structure instead. Therefore it would be better to avoid these and other identifiers that happen to be C++ keywords.

#Returning a node of linked list stack overflow code#

New and delete are C++ keywords and C code is commonly included in C++ programs. Avoids potential surprises if a header file alters macro definitions or compiler settings that affect subsequent code.Īvoid identifiers that clash with keywords of similar languages.Results in more comprehensible error messages when your declarations clash with those in an included header.Gives readers a quick glance at the libraries used throughout the source file.Include all library headers near the beginning of the file #include Printf('delete(&head, 33) returns %i ', delete(&head, 33)) Printf(' node *null_h = NULL delete(&null_h, 90) returns %i ', Printf('delete(NULL, 90) returns %i ', delete(NULL, 90)) Printf('find(NULL, 90) returns %i ', find(NULL, 90)) Printf('insert(NULL, 33) returns %p ', insert(NULL, 33)) Printf('Trying functions with NULL head or not stored data. ') Printf('Head after deletion: pointer: %p data: %i ', head, head->data) * find: returns 1 if there is at least one occurrence of data in the list * address head, then sets *head to NULL implying an empty list. * destroy: delete all nodes in the list pointed by the pointer stored at * Returns 1 if a node has been deleted, 0 otherwise. * data in its data field) in the list pointed by the pointer stored at * delete: delete the first occurrence of data (i.e the first node which has * Returns the pointer of the new node or NULL if the process failed. * insert: creates and inserts a new node (storing data) in the list pointed by * Delete: O(n): since we are deleting the first occurrence of a specific data. * Insert: O(1): since all new nodes will replace the head. * Search: O(n): search operations are performed in linear time. * The last element is linked (points) to nothing (NULL). * preserved since without it, it's not possible to traverse the list. * The first element is often called 'head' and (a pointer to it) must be Each element (node) contains data and a link to I decided to keep things as simple as possible writing just the basic operations for the list.Īll the code is in one file because I'd like to store all these implementations in single files (as snippets) for future reference.īy the way this is the first time I post here, please don't be kind. I'd like to get feedback about my style and decisions I made.

I'm studying and implementing some data structures.