I have a binary tree that's pretty flat and will like only get 4-5 nodes deep. I've always traversed trees with a simple recursive function call made a each branch node. I understand that traversing in this manner is more memory intensive than searching non-recursively, so my question is, how many levels of recursive function calls can I make and do I need to be concerned about memory usage if my tree is only 4-5 nodes deep?
Thanks! Rich -- For information on using the Palm Developer Forums, or to unsubscribe, please see http://www.palmos.com/dev/support/forums/
