void levelordertraversal(struct node* root,height)
{
int i=0;
for(i=1;i<=height(root);i++
printlevel(root,i);
}
void printlevel(struct node *root, level)
{
if(root == null)
return;
else if(level==1)
printf("%d",root->data);
else if(level>1)
{
printlevel(root->left,level-1);
printlevel(root->right,level-1);
}
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
