StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POLinked list maintain the root pointer address to read it later after building it
primarykey
Id
14765485
data
AcceptedAnswerId
14765789
AnswerCount
4
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-02-08T04:04:22.410
FavoriteCount
0
LastActivityDate
2013-02-08T20:56:14.470
LastEditDate
2013-02-08T20:56:14.470
LastEditorUserId
1504633
OwnerUserId
1504633
ParentId
0
PostTypeId
1
Score
1
ViewCount
3313
LastEditorDisplayName
text
Body
I am a new learner and trying to build linked list. I am able to do so but I am trying to keep the pointer of root or first node so after building linked list I can read the list or execute the pattern matching but I am not able to do it successfully. Can you please help here? <pre><code>#include <stdio.h> #include <stdlib.h> struct node { int x; struct node *next; }; int main(){ int d; struct node *linked; struct node *head; linked = malloc (sizeof(struct node)); head = linked; <<<< As this is pointer, in while loop whenever malloc executes it changes the value of head as well. printf ("Location of head %p \n", head->next); d = 1; while (d>0){ printf ("Enter the value of X: "); scanf ("%d", &linked->x); linked->next = malloc (sizeof(struct node)); printf ("Location of linked %p \n", linked->next); printf ("Location of head %p \n", head->next); printf ("To enter further value enter non zero: "); scanf ("%d", &d); if (d==0) linked->next = NULL; } //linked->next = NULL; printf("Value of Next is %p\n", linked->next); printf ("Location of head %p \n", head->next); } </code></pre> Output: <blockquote> MacBook-Air:cprog jimdev$ ./a.out Location of head 0x7fff90ab952c <<<< this value should not be change but here in sub sequent output it is. Enter the value of X: 0 Location of linked 0x7ff0624039c0 Location of head 0x7ff0624039c0 <<<< different value then previous To enter further value enter non zero: 3 Enter the value of X: 3 Location of linked 0x7ff0624039d0 Location of head 0x7ff0624039d0 <<<< different value then previous To enter further value enter non zero: 0 Value of Next is 0x0 Location of head 0x0 </blockquote> I just tried this new one it does the printf of linked list elements as well, let me know if you guys think of any improvement. I know recursion is quick and neat way to achieve it but I wanted to try out something with while loop. <h1>include </h1> <h1>include </h1> struct node { <pre><code> int x; struct node *next; }; </code></pre> int main () { <pre><code> int d, hold, i; struct node *list; struct node *head; struct node *current; list = (node *)malloc(sizeof(struct node)); head = list; printf ("Location of list is %p \n", head); d = 1; </code></pre> while (d>0){ <pre><code> printf ("Enter the value of X: "); scanf ("%d", &list->x); printf ("Location of list is %p\n", list); current = (node *)malloc (sizeof (struct node)); list->next = current; list = current; printf ("Location of head is %p\n", head); printf ("Enter zero to terminate the loop: "); scanf ("%d", &d); } list->next = NULL; printf ("Value of last next is %d\n", list->next); current = head; i = 1; while (current->next != 0){ printf ("Location of list is %p \n", current); printf ("Value of linked list %d elements %d \n", i, current->x); current = current->next; i++; } scanf ("%d", &hold); </code></pre> }
Tags
<c>
Title
Linked list maintain the root pointer address to read it later after building it
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USdevnp
UserOwnerUserId
1. USdevnp
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POLinked list maintain the root pointer address to read it later after building it
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTApproveEditSuggestion
2. VO
 singulars
 PostPostId
 POLinked list maintain the root pointer address to read it later after building it
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.