Search:

well I wrote my test case. For me it's right.
I ask a second opinion???

Thanx

Hi developers,

I only wanne know: Is this solution right?

Problem:

I have to write a function wich returns
the largest key (node->key == Max) in an ordered binary tree.

int Maxkey(const...

Thanx for your code dwks

Is this a right sollution?

Thanx for answer

Hi xErath or other people,

xErath thanx for message.
When I understand you good, you mean:


unsigned Min(node *n) {
unsigned min;

if (n == NULL)

Hi Quzah or other programmers,

Can you help me more pls.
I now have the following:


unsigned Miniumum(node **n,int number) {
if (*n != NULL)
return number;
...

I think I have it, but not recursive
I must have it recursive




int MinList (NodePtr theList) {
int min = theList -> data; //set minimum to first data
NodePtr currNodePtr =...

Hi developers :cool: ,

I have to write a function that finds the largest key (in my node)
in a binairy ordered tree.

Like: int Maxkey(const node *n )

Hello programmers :cool: ,


I have to develope a recursive function in C.


Given a linked list and node:

First --> [7][ ] --> [23] [ ] --> [9] [ ] --> [43] [ ] --> [51] [•]