[algogeeks] Re: Binary Tree - Depth First Search

2006-10-27 Thread Nat (Padmanabhan Natarajan)
Thats correct.On 10/27/06, arun kumar manickan [EMAIL PROTECTED] wrote: DFS on a BST= it pre order traversal .. is this correct ? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to

[algogeeks] Re: Binary Tree - Depth First Search

2006-10-26 Thread L7
draw a trivial tree. Traverse it 'in-order'. Do a DFS. See if you get the same result. Don't underestimate the power of paper and thought. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To