Hi This is the basic breadth first search algo. We can use a queue to achieve such a traversal.
Check this out : http://en.wikipedia.org/wiki/Breadth-first_search -- Aravind Narayanan [EMAIL PROTECTED] On 4/29/07, misty <[EMAIL PROTECTED]> wrote: > > > hi friends > I want to know ,how to write a C function to traverse a binary tree > level by level. In each level,the tree is traversed from left to right. > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
