you can use a queue to make a bfs and store all nodes in the queue. And then the sucessor is under control:)
On Mon, Jan 19, 2009 at 7:41 PM, sharad kumar <aryansmit3...@gmail.com>wrote: > > could somebody pls tell me how to find bfs sucessor of a node in a > tree (BST as well as binary) > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
