A friendly place for programming greenhorns!
Big Moose Saloon
Register / Login
Win a copy of
Head First Android
this week in the
Java in General
Recursive / Non-Recursive Function
Joined: Dec 09, 2006
Dec 04, 2007 23:38:00
What is the best way to write a recursive and non-recursive solution for a binary tree in order traversal?
Joined: Jan 29, 2003
Dec 05, 2007 08:48:00
Work this with pencil and paper first and see how it goes.
1 .-------. 2 5 .---. .---. 3 4 6 7
What are the rules to visit in order? Something like:
1 Go left as long as you can
2 Go back to the last place you haven't gone right yet
3 Go right
4 Repeat from 1
First make a "Node" with "left" and "right" variables that refer to other nodes. Set up the 1,2,3 nodes. See if you write "go left as long as you can" in a loop. Then we'll worry about the next steps.
Take a shot at this in code and show us what you make. If you get stuck, then we'll know right where to help.
A good question is never answered. It is not a bolt to be tightened into place but a seed to be planted and to bear more seed toward the hope of greening the landscape of the idea. John Ciardi
I agree. Here's the link:
subject: Recursive / Non-Recursive Function
Towers of Hanoi
how to clear the stack
Is it possible to delete all files and folders in a drive non-recursively?
Iterative Fibonacci Method Problem
All times are in JavaRanch time: GMT-6 in summer, GMT-7 in winter
| Powered by
Copyright © 1998-2015