Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with linked-list
Search options not deleted
user 56767
A linked list is a data structure in which the elements contain references to the next (and optionally the previous) element.
2
votes
Is this the right way to delete a node?
OK, this is what I see:
Node** ptr = head;
You don't really need this, you can just change the name in the function arguments or just use head later on.
while (*ptr && (*ptr)->data != value)
p …
- 458