Search:

Sorry, let me clarify.

Each tree may or may not have unique indices.

If an index is unique, then it should appear in the sum.

So basically the sum is an ordered list of unique indices and...

Yes but recursion is using a stack which will never be filled with all the data from the tree at the same time (as when a function finishes recursion, its value is removed) and therefore will never...

Forgot to say.. index can only appear once for any value, and most indexes don't appear at all.

So a typical tree might contain only 4,26,45 and 74, for example.

Therefore an array...

So the algorithm to traverse a binary search tree structure in C:



typedef struct Node {
int ind;
int val;
struct Node *left;
struct Node *right;
} Node;

Interesting replies, thanks for the insights. Now I get what's going on with memory in C.

Thanks again all

Then how come the following code works?



char snRows[50], snCols[50];
fscanf(FP, "%s %s", snRows, snCols);


Also.. are all variables in C stored on the stack unless otherwise specified...

foxman,

Thank you very much for your help, that has fixed it. I think it was that before I was creating a pointer to a pointer to a pointer:

(ie. *rows[] was an array of pointers to MLists and...

Thanks for the quick reply.

OK.. this is the function that creates the structure from a text file; outputs a pointer to a Matrix structure:



Matrix *CreateFromFile(char *filename)
{
...

Hey Everyone

I am having some trouble with pointers in my C program. I vaguely know how they work and I have read countless (very good) tutorials, such as the ones here:
...