seunthomas:

Relax na. Since the guy did not even create a proper struct if i answer how can he mark it?? Can a teacher mark question that he does not know the answer?

seunthomas:

Relax na. Since the guy did not even create a proper struct if i answer how can he mark it?? Can a teacher mark question that he does not know the answer?

FincoApps:


This 1998 stuff ehn... you guys dhtml and airsaylongcon are not serious at all

dhtml18:

Yes it is, at least according to my knowlege of C, but you may not believe it, so check the link below:
https://en.wikipedia.org/wiki/Struct_(C_programming_language)

airsaylongcon:


Let me retype that struct for you as you seem to have a problem that I collapsed it into one line

Struct t {
int i;
int m;
Struct t *b;
Struct t *d;
}

dhtml18:

See now, he cannot even remember how to declare a struct anymore, that section of his memory has been overwritten. . .due to old age in programming.

seunthomas:

bro, one of the things that makes a good programmer is that we open our eyes and see code not look and make assumptions.
Struct declaration cant be like so
struct t (int i,m; struct t *b, *d)
So @airsaylongcon does not know what he is typing.
And if he does not know what he is typing how can i be sure he knows the correct answer and not here to waste my time.

DanielTheGeek:


Bro you are good. Shikena, please keep quiet!
Let the real purpose of the thread be fulfilled.

seunthomas:

Look closely oga
struct t (int i,m; struct t *b, *d)
no curly bracket but normal bracket

seunthomas:
Just admit that you flunked the question and did not even set it correctly...

seunthomas:
Seriously bro am disappointed you can descend low like this ohh

airsaylongcon:


Why you dey run mouth? How many hours e take you to ask me your own?. I will modify this post with the question so look out

*modified*
A data structure is "built" using nodes. Each node has exactly two pointers that point to other nodes. None of the pointers is null. A C program is written to count how many nodes are accessible from any of the nodes in th data structure. The code use an "indicator" field (initialized to zero for all nodes). Correct the following code so that it works properly as it will not work in its current state

struct t (int i,m; struct t*b, *d)
int count(struct t*a)
{
If (a->m) return 0;
return count(a->b) + count(a->d)+1;
}




Am not saying i wont solve it but you asked a question and you dont even know the answer so how do i know if am correct or wrong?
Just common sense...

dhtml18:
*Laughing uncontrollably* seunthomas is really sweating this one out. . . .he seems to have run into a stackoverflow error (or rather its C equivalent since this is not JAVA lang).

Do While flunk = true
Debug.Write("This is getting rather funny"
Loop

airsaylongcon:


Descend low how? What was it that I said that implied I descended low. I challenged you for a question at 6:57am and that question did not come until some time in the evening. Is that descending low?

seunthomas:

You quickly corrected your mistake na(boju boju as yoruba would say-cover up). Admit you set a wrong question and you get the answer but you may need to contact a c programmer to be sure. What i provide will actually run when compiled.

airsaylongcon:


Provide it lets see

seunthomas:
A data structure is "built" using nodes. Each node has exactly two pointers that point to other nodes. None of the pointers is null.
struct t {
int i;
int m;
struct t *b, *d;
};

Assumption 1:
t->b is not null
t->d is not null

A data structure is basically a kind of container to store data
This problem is actually a tree(cant remember which type specifically)....

airsaylongcon:


Is this all?

airsaylongcon:


Is this all?

seunthomas:

You have so many mistakes in the code am correcting and checking with compiler.
int count(struct t*a)
{
If (a->m) return 0; //WRONG If should be if
return count(a->b) + count(a->d)+1;
}

seunthomas:
typedef struct t {
int i;
int m;
struct t *b, *d;
}data;
int count(data *a)
{
if (a->m){
return 0;
}

return count(a->b) + count(a->d)+1;

}


No need am calling it a night. I need to look at it closely, right now i just fixed your typos. This runs but i have bus 10 error.
C is a killer no garbage collection etc.

I dont want to crash my machine

airsaylongcon:


Take your time. I'm not in a rush. Just mention me when you are done

seunthomas:
@airsaylongcon
The good thing about this challenge is am cracking my brain. lol

See you in the morning when my power is back. You will be in real trouble then

airsaylongcon:


I'm shivering