StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
6011828
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
3
CommunityOwnedDate
CreationDate
2011-05-15T23:01:19.120
FavoriteCount
0
LastActivityDate
2011-05-15T23:30:43.550
LastEditDate
2011-05-15T23:30:43.550
LastEditorUserId
15168
OwnerUserId
15168
ParentId
6011798
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
I believe <code>crearArbol</code> requires a pointer to a pointer as input: <pre><code>void crearArbol(tABB *arbol) { tABB nuevoA = (tABB)malloc(sizeof(tTree)); if (nuevoA == 0) ...handle out of memory error... *arbol = nuevoA; (*arbol)->izq = NULL; (*arbol)->der = NULL; } </code></pre> And the call: <pre><code>crearArbol(&AUX); </code></pre> Otherwise, you don't 'return' the value to the calling code. <hr> Additionally, just after that you have: <pre><code> if(id_cuenta==1) { (AUX->tLista)->fondo=saldo; return 0; } </code></pre> But if you've just called <code>crearArbol()</code> there is no initialization of the <code>tLista</code> member, so it points at garbage. You need to allocate the space for it to point to, and set the <code>tLista</code> member to point to it; then you can set the <code>fondo</code> member of that allocated space. Make sure you initialize every member of every structure... <hr> Update 1: fixed notation in <code>crearArbol()</code> - the extra parentheses are needed. You also have to worry about the call to <code>crearArbol()</code> in <code>main()</code>, which I missed before. You are missing a <code>return</code> from <code>AgregarCuenta()</code>, or the return type should be <code>void</code> and the other <code>return</code> statements in the function would lose the value. Since you don't check the returned value, it is not clear which is better. <hr> Update 2: this code compiles and runs. It leaks memory, of course. <pre><code>#include <stdlib.h> typedef struct nodo { int cuenta; int fondo; struct nodo *sig; }pNodo; typedef pNodo *tLista; typedef struct tree { int RUT; struct tree *izq; struct tree *der; struct nodo *tLista; }tTree; typedef tTree *tABB; typedef tTree *tNodo; static void crearArbol(tABB *arbol) { tABB nuevoA = (tABB)malloc(sizeof(tTree)); *arbol=nuevoA; (*arbol)->izq = NULL; (*arbol)->der = NULL; (*arbol)->tLista = malloc(sizeof(pNodo)); (*arbol)->tLista->cuenta = -1; (*arbol)->tLista->fondo = -1; (*arbol)->tLista->sig = NULL; } static int AgregarCuenta(tABB *arbol, int rut, int id_cuenta, int saldo) { tABB AUX; AUX=*arbol; tLista nuevaC; int i=1; if(AUX==NULL) { crearArbol(&AUX); if(id_cuenta==1) { (AUX->tLista)->fondo=saldo; return 0; } else { return -1; } } else { if(rut==AUX->RUT) { while(AUX->tLista!=NULL) { if(AUX->tLista->cuenta==id_cuenta) { return -1; } else { AUX->tLista=AUX->tLista->sig; i++; } } nuevaC=(tLista)malloc(sizeof(pNodo)); nuevaC->sig=NULL; nuevaC->cuenta=i; nuevaC->fondo=saldo; AUX->tLista=nuevaC; return 0; } else { if(rut<AUX->RUT) { AUX=AUX->izq; return AgregarCuenta(&AUX,rut,id_cuenta,saldo); } else { AUX=AUX->der; return AgregarCuenta(&AUX,rut,id_cuenta,saldo); } } } } int main(void) { tABB arbolillo; crearArbol(&arbolillo); AgregarCuenta(&arbolillo, 18020200, 1, 9999); return 0; } </code></pre> When run with <code>valgrind</code>, I get: <pre><code>==25013== Memcheck, a memory error detector ==25013== Copyright (C) 2002-2010, and GNU GPL'd, by Julian Seward et al. ==25013== Using Valgrind-3.6.0 and LibVEX; rerun with -h for copyright info ==25013== Command: tree ==25013== ==25013== Conditional jump or move depends on uninitialised value(s) ==25013== at 0x100000DC0: AgregarCuenta (tree.c:54) ==25013== by 0x100000EC5: main (tree.c:95) ==25013== ==25013== Conditional jump or move depends on uninitialised value(s) ==25013== at 0x100000E52: AgregarCuenta (tree.c:77) ==25013== by 0x100000EC5: main (tree.c:95) ==25013== ==25013== ==25013== HEAP SUMMARY: ==25013== in use at exit: 184 bytes in 5 blocks ==25013== total heap usage: 5 allocs, 0 frees, 184 bytes allocated ==25013== ==25013== LEAK SUMMARY: ==25013== definitely lost: 64 bytes in 2 blocks ==25013== indirectly lost: 32 bytes in 2 blocks ==25013== possibly lost: 0 bytes in 0 blocks ==25013== still reachable: 88 bytes in 1 blocks ==25013== suppressed: 0 bytes in 0 blocks ==25013== Rerun with --leak-check=full to see details of leaked memory ==25013== ==25013== For counts of detected and suppressed errors, rerun with: -v ==25013== Use --track-origins=yes to see where uninitialised values come from ==25013== ERROR SUMMARY: 2 errors from 2 contexts (suppressed: 0 from 0) </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POCombining Trees and Nodes, value unaccessible
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USJonathan Leffler
UserOwnerUserId
1. USJonathan Leffler
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POCombining Trees and Nodes, value unaccessible
 singulars
 PostTypePostTypeId
 PTQuestion
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
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTDownMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
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.