Need help for this question to get output.(very very urgent)
Using Java, write a method that does an in-order traversal of a binary tree WITHOUT using recursion. based on the following code
This program should run to get the output.
I think I have this ListNodes method but I need some code to create a binary tree and pass the root node as parameter to this method
BTreeNode.java
public class BTreeNode
{
public BTreeNode LEFT;
public BTreeNode RIGHT;
public String VALUE;
}
BTreeUtil.java
public class BTreeUtil
{
public static void listNodes(BTreeNode a_oRootNode)
{
// insert code here...
}
}
[646 byte] By [
samuelea] at [2007-10-2 13:42:35]
Sure I can run something up that you can submit as having been your work.Of course, you'd then find out that it works only for the test program I include, and not for anything else.Must be that time of year again.Sylvia.
Don't expect others to do you work for you. Post your best effort, and ask specific questions about the parts that are giving you trouble.
And don't mark your question as urgent. I promise you, it is 100% guaranteed NOT to get you help any faster than you would otherwise. Nobody here cares the tiniest bit about your urgency. The only effect it might have is to piss somebody off who might have otherwise answered, thus having the opposite of your desired effect.
