StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POAccessing NULL pointers
primarykey
Id
11645371
data
AcceptedAnswerId
11645760
AnswerCount
2
ClosedDate
CommentCount
12
CommunityOwnedDate
CreationDate
2012-07-25T08:11:55.617
FavoriteCount
0
LastActivityDate
2012-07-25T08:37:02.263
LastEditDate
2012-07-25T08:35:20.260
LastEditorUserId
1516649
OwnerUserId
1516649
ParentId
0
PostTypeId
1
Score
0
ViewCount
118
LastEditorDisplayName
text
Body
<p>This is part of my code... and i have several major problems that im stuck on... ok most of the problem that i can see so far has been fixed... but im still lost on where to free the memory. this is the error message when i end the program :S</p> <pre><code> HEAP SUMMARY: ==15468== in use at exit: 20 bytes in 1 blocks ==15468== total heap usage: 1 allocs, 0 frees, 20 bytes allocated ==15468== ==15468== 20 bytes in 1 blocks are definitely lost in loss record 1 of 1 ==15468== at 0x4025BD3: malloc (vg_replace_malloc.c:236) ==15468== by 0x8048601: newnode (myassignment.c:27) ==15468== by 0x804885E: insertavl (myassignment.c:88) ==15468== by 0x8048B33: main (myassignment.c:156) ==15468== ==15468== LEAK SUMMARY: ==15468== definitely lost: 20 bytes in 1 blocks ==15468== indirectly lost: 0 bytes in 0 blocks ==15468== possibly lost: 0 bytes in 0 blocks ==15468== still reachable: 0 bytes in 0 blocks ==15468== suppressed: 0 bytes in 0 blocks ==15468== ==15468== For counts of detected and suppressed errors, rerun with: -v ==15468== ERROR SUMMARY: 1 errors from 1 contexts (suppressed: 13 from 8) typedef struct node *tree; struct node { int data; char name; int height; struct node *left; struct node *right; }; static tree newnode(int d,char n){ tree t = malloc(sizeof(struct node)); t->data = d; t->name=n; t->left = NULL; t->right = NULL; memoize(t); return t; } static tree modnode(int d, char n,tree t){ if (d > t->data){ t->data=d; t->name=n; t->right = t->right;} else{ t->data=t->data; t->name=t->name; t->right = t->right;} return t; } tree insertavl(tree t, int d,const char *n){ if (t == NULL) return newnode(d,*n); else if (t->name==*n) return modnode(d,*n,t->right);// <=========(1) else { printf("went right"); setright(t, insertavl(t->right, d,n)); } return t; } int main(void) { int i = 0; char foo[11]; int c; tree t= NULL; for(c=0;c<=1000;c++) { i = readstring(foo,10); if(i == 0) break; if (strcmp("score",foo)==0){ int a=0; int point; char n[21]; printf ("Enter name \n"); a=readstring (n,20); printf ("Enter score \n"); scanf("%d", &point); t=insertavl(t,point,n);} if (strcmp("highscore",foo)==0){ printf ("%d \n", highsc(t));} if (t==NULL){ printf ("false");} } return 0; } </code></pre> <p>i know my program is not efficient but i wan to fix the error first.,,any help is appreciated! </p>
Tags
<c><gcc>
Title
Accessing NULL pointers
singulars
PostAcceptedAnswerId
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USuser1516649
UserOwnerUserId
1. USuser1516649
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
VotesPostIdCreationDate
1. This table or related slice is empty.
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.