Just use a stack to stimulate the recursive method -----Original Message----- From: algogeeks@googlegroups.com [mailto:[EMAIL PROTECTED] On Behalf Of martin-g Sent: Monday, August 14, 2006 11:58 AM To: Algorithm Geeks Subject: [algogeeks] Nonrecursive algorithms for printing out BST keys
Hi. Would you help me in composing a nonrecursive algorithm to print out the keys of BST nodes in ascending order. Any approach will do whether it uses stack or not. Thanks in advance Martin --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
