I need to do a non-recursive function for count the leafs in a tree. I have the recursive algorithm, Can someone help me to figure this out!!
count leafs
int count_Lnodes(root, int cnt)
{
if (root != NULL)
{
cnt = count_Lnodes(root->left, cnt);
cnt = count_Lnodes(root->right, cnt);
if (root->left == NULL && root->right == NULL) ++cnt;
}
return cnt;
}
Jump to Posta. correct your existing code so that it will compile without errors; test it.
b. convert the recursive algorithm to a tail-recursive form.
c. convert the tail-recursive implementation to an iterative one.
for steps b. and c., see:
a. correct your existing code so that it will compile without errors; test it.
b. convert the recursive algorithm to a tail-recursive form.
c. convert the tail-recursive implementation to an iterative one.
for steps b. and c., see:
http://en.wikipedia.org/wiki/Tail_recursion
http://www.nist.gov/dads/HTML/tailrecursn.html
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.