StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
6397403
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
9
CommunityOwnedDate
CreationDate
2011-06-18T16:40:07.993
FavoriteCount
0
LastActivityDate
2011-06-18T17:00:35.473
LastEditDate
2011-06-18T17:00:35.473
LastEditorUserId
81915
OwnerUserId
81915
ParentId
6397344
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
A far better solution could be using list instead of stack to implement linked list. The code given is stack implementation of linked list, which I believe is a norm in python but in C/C++ you can use list for efficient implementation. A sample code in C would be as follows :- <pre><code>#include <stdio.h> #include <stdlib.h> struct node{ int data; struct node *next; }; struct node* add(struct node *head, int data){ struct node *tmp; if(head == NULL){ head=(struct node *)malloc(sizeof(struct node)); if(head == NULL){ printf("Error! memory is not available\n"); exit(0); } head-> data = data; head-> next = head; }else{ tmp = head; while (tmp-> next != head) tmp = tmp-> next; tmp-> next = (struct node *)malloc(sizeof(struct node)); if(tmp -> next == NULL) { printf("Error! memory is not available\n"); exit(0); } tmp = tmp-> next; tmp-> data = data; tmp-> next = head; } return head; } void printlist(struct node *head) { struct node *current; current = head; if(current!= NULL) { do { printf("%d\t",current->data); current = current->next; } while (current!= head); printf("\n"); } else printf("The list is empty\n"); } void destroy(struct node *head) { struct node *current, *tmp; current = head->next; head->next = NULL; while(current != NULL) { tmp = current->next; free(current); current = tmp; } } void main() { struct node *head = NULL; head = add(head,1); /* 1 */ printlist(head); head = add(head,20);/* 20 */ printlist(head); head = add(head,10);/* 1 20 10 */ printlist(head); head = add(head,5); /* 1 20 10 5*/ printlist(head); destroy(head); getchar(); } </code></pre> In the above example if you create an array of pointers with size 3, each of the pointer pointing to head, you can create three linked lists. This would handle the space with maximum efficiency and there is no need to check for free nodes too.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POhow to implement 3 stack in a single array efficiently?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USstack programmer
UserOwnerUserId
1. USstack programmer
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. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId

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.