Board index » delphi » Binary Search Tree - Non-recursive traversal
R. E. Donais
![]() Delphi Developer |
Sun, 11 Oct 1998 03:00:00 GMT
Binary Search Tree - Non-recursive traversalQuoteIn article <4lk3jl$...@news.nstn.ca> Denis Blondeau wrote: to the parent nodes. If the child doesn't have a pointer linking back to the parent, you'll have to implement one - typically done using a stack. That's why traversing a tree is so easy to do with recursion, because recursion is a stack operation. ...red Knowledge is one of the few things that you |