hello =D i've looking for some help using the search but couldnt get it.. i need to implement a binary tree and the usual funcions.. and i need a function that shows the in-ordern N element.. i could get it to work using a simple recursive function with a statis var (int printn(NODE *tree, int n))... it works.. the first time.. the second time it fails because the non-zero static variable..
can any1 get a simple solution on this?
any other comment on the code would be fine too
and sorry for my (bad) english xD
this code only need to pass a automatic batery test.. so dont worry about memory leaks and wrong input xD
ty in advance