Simple tree problem

Thread view:

TheBigPJ - 03 Mar 2008 19:25 GMT

What I want to do: Represent every combination of ABC in a tree (with
Nodes).

What my code isnt doing: *see above*

I need advice on this, I have the basic idea but I am not seeing the
logic I need.

(I want to eventually take in any String (not char - but keeping it
simple for now) and any length you want and it give you all the
combinations of that String of any length.)

Any help would be greatful, I know trees a big thing in general but I
want to keep things simple.

Thanks,
Peter
-----------------------------
class Test
{

public static void main(String args[])
{
Node a = new Node('a','b','c', 3, 'a');
System.out.println("Test: " + a.getData());
System.out.println("Test2: " +
a.getleftNode().getleftNode().getData());
}

}

-----------------------------
class Node
{
Node leftNode;
Node middleNode;
Node rightNode;
char weight;

Node(char leaf, char theData)
{
weight = leaf;
}

Node(char a, char b, char c, int temp, char theWeight)
{
if(temp > 0)
{
leftNode = new Node('a','b','c',temp-1, theWeight);
middleNode = new Node('a','b','c',temp-1, theWeight);
rightNode = new Node('a','b','c',temp-1, theWeight);
}
weight = theWeight;
}

public void setData(char theData)
{
weight = theData;
}

public char getData()
{
return weight;
}

public Node getleftNode()
{
return leftNode;
}

public Node getmiddleNode()
{
return middleNode;
}

public Node getrightNode()
{
return rightNode;
}

}

Reply to this Message

TheBigPJ - 03 Mar 2008 20:49 GMT

Ive got this far.... seems to be working, is this the right way to do
it?

Thanks,
Peter
---------------------------------
class Node
{
Node leftNode;
Node middleNode;
Node rightNode;
char weight;

Node(char theData)
{
weight = theData;
}

Node(char leftData, char middleData, char rightData, char currentData)
{
weight = currentData;
leftNode = new Node(leftData);
middleNode = new Node(middleData);
rightNode = new Node(rightData);
}

public void setLeftNode(char leftData, char middleData, char
rightData)
{
leftNode = new Node(leftData, middleData, rightData, leftData);
middleNode = new Node(leftData, middleData, rightData, middleData);
rightNode = new Node(leftData, middleData, rightData, rightData);
}

public void setMiddleNode(char leftData, char middleData, char
rightData)
{
leftNode = new Node(leftData, middleData, rightData, leftData);
middleNode = new Node(leftData, middleData, rightData, middleData);
rightNode = new Node(leftData, middleData, rightData, rightData);
}

public void setRightNode(char leftData, char middleData, char
rightData)
{
leftNode = new Node(leftData, middleData, rightData, leftData);
middleNode = new Node(leftData, middleData, rightData, middleData);
rightNode = new Node(leftData, middleData, rightData, rightData);
}

public void setData(char theData)
{
weight = theData;
}

public char getData()
{
return weight;
}

public Node getLeftNode()
{
return leftNode;
}

public Node getMiddleNode()
{
return middleNode;
}

public Node getRightNode()
{
return rightNode;
}

}
---------------------------------
class Test
{

public static void main(String args[])
{
Node a = new Node('a','b','c', '-');
Node head = a;
a.setLeftNode('a','b','c');
a.setMiddleNode('a','b','c');
a.setRightNode('a','b','c');
a.getLeftNode().setLeftNode('a','b','c');
a.getMiddleNode().setMiddleNode('a','b','c');
a.getRightNode().setRightNode('a','b','c');

System.out.println("Test: " + a.getData());
System.out.println("Test2: " +
a.getLeftNode().getMiddleNode().getMiddleNode().getData());
}

}

Reply to this Message

Simple tree problem

Free Magazines