[mones]

please can any body help me and solve these qustion ..

1- write recursive function that calculates and returns the length of a linked list..

2-write a c++ code for inorderd postfix eg:-

1+2-2*6/1

and preorderd postfix using stack

+/*-12345

the user should enter the numbers and operatins

please I need the code in C++ ..

thanx..

[AGCurry]

Hmm, another class assignment, eh?

Okay, I'll get you started with the first one, in ANSI C syntax:

int list_length( LIST *list )
{
return( list ? 1 + list_length( list->next ) : 0 ) ;
}

[blaqDeaph]

First up, read up on whats postfix and whats a stack, then use a simple parsing mechanism. I'll give you a hint:

char *exp = "1+2-2*6/1"

strtok(exp, "+-*/") will return the first number, and strtok(NULL, "+-*/") will return the subsequent numbers in the string, and it will return NULL when it reaches the end of the string.

[mones]

AGCurry thaaaaaaaaaaaaaaaaanx...

blaqDeaph .. I understand postfix & stack and i've tried to write the postfix but i have soooomany errors ..
I feel that my brain did't work
or there is a problem with my studing so that i can't solve ..
what should i do ...???????

i need the sol 4 tommorw ..

next time i'll try to solve some problems here but you will be my teacher and correct them

[blaqDeaph]

Well, post the code that you have so far?