recusively i have already done
void show_tree_asc(KNOTEN *zeiger)
{
if(zeiger != NULL)
{
show_tree_asc(zeiger->links);
printf("<-%d->",zeiger->wert);
show_tree_asc(zeiger->rechts);
}
}
INFO:
zeiger=pointer
links = left
rechts = right
wert = value
now i need the metho iterativ
here is my attempt but its not 100% correct i think it shows only left tree and then stops
void show_tree_asc_iter(KNOTEN *zeiger)
{
while(zeiger != NULL)
{
zeiger = zeiger->links;
printf("<-%d->",zeiger->wert);
zeiger = zeiger->rechts;
}
}
Greetings,
I am BS-CS graduate having majors in Software Engineering. I have knowledge of C++ and has done coding in the domain as well.
Hoping to hear soon from you to discuss more details.
https://www.freelancer.pk/u/ajaykumar1127.html this is my original , there were no bids remaining so that's why trying from here.
You can check me out if i am good or not!!
:)