Thread: Help with this binary tree

I have created a arrayQueue and binaryTreeTraversal class that has different traversal methods, both of these classes work

I have got my BinaryTreeNode class

public class BinaryTreeNode
{
 
    }
}

I basically want to print out A+B in the traversal, but when i compile it says actual and formal argument lists differ in length.

Is this to do with my BinaryTreeNode class?

Thanks very much

"no suitable constructor found for BinaryTreeNode(java.lang.String,BinaryTreeNode,Bin aryTreeNode)

constructor BinaryTreeNode.BinaryTreeNode(BinaryTreeNode,Binar yTreeNode) is not applicable (actual and formal argument lists differ in length)

constructor BinaryTreeNode.BinaryTreeNode(java.lang.Object) is not applicable (actual and formal argument lists differ in length)"

Thanks

Thank you
It works now, next time I will be sure to read the error message properly

Sorry to ask another question.

My tree works perfect now printing out, A+B or A-B / C in all four different traversals.

Here is my code:

BinaryTreeNode n1 = new BinaryTreeNode("A");

I have done nothing different from what I can tell,

Thanks for any help

I don't understand what you mean sorry?

Everything compiles fine and there are no errors.
The only error as I said before is that that output of the PostOrder traversal result is : AB*C/D^E^, but the postOrder should not be like that.

To insure I get the correct postOrder traversal from: (A*B) / (C^D^E), I was just wondering if I would have to put brackets to somehow tell the computer to do one bit first because if I dont I get the output : AB*C/D^E^ instead of AB*CDE^^/

Hope I am a lot clearer now, thanks

This will compile and run the test

public class Testing
{
 
}

Sorry, code should work now

From the test class I am creating new binaryTreeNodes that make up: (A*B) / (C^D^E), from the Traversal class it will then go through the nodes and output each node onto the screen in the order they should be. Example:

 public void inOrder(BinaryTreeNode t)
    {
        ArrayQueue q = new ArrayQueue();
        if (t != null)
        {  
            inOrder(t.leftChild);
		    visit(t);
		    inOrder(t.rightChild);			
		}
    }

that will output: A*B / C^D^E, ArrayQueue class is just used to store the nodes.

My problem is that when outputting in postOrder, it does not output the correct sequence for this.

If I changed the code for A-B / C

BinaryTreeNode n1 = new BinaryTreeNode("A");
        BinaryTreeNode n2 = new BinaryTreeNode("B");
        BinaryTreeNode n3 = new BinaryTreeNode("-",n1,n2);
        BinaryTreeNode n4 = new BinaryTreeNode("C");
        BinaryTreeNode n5 = new BinaryTreeNode("/", n3, n4);       
        System.out.println("\nInOrder Traversal: ");
        traversal.inOrder(n5);
        System.out.println("\npostOrder Traversal: ");
        traversal.postOrder(n5);

This would print perfectly in both inOrder and postOrder

1. Traverse left sub tree
2. Traverse right sub tree
3. Visit root

public void postOrder(BinaryTreeNode t)
    {
        ArrayQueue q = new ArrayQueue();
        if (t != null)
        {
            postOrder(t.leftChild);
            postOrder(t.rightChild);
            visit(t);					
        }
    }

I assumed that was correct?

it is just 'to the power of'

Does that mean I will have to include the brackets in me code?

Example:

BinaryTreeNode n1 = new BinaryTreeNode("A");

Yes I have worked through it manually, I have managed to sort it now, thanks very much for your help