queue q;
q.enqueue(root);
while q is not empty
do
print :temp=dequeue();
if(temp->left)
enqueue(temp->left)
if(temp->right)
enqueue(temp->right);
end while;
On Wed, Jun 27, 2012 at 2:59 PM, Gobind Kumar Hembram
<gobind....@gmail.com>wrote:
> Write C code to implement level order traversal of a tree.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
