[SOLVED] BST Frequency Counter

[theonly]

I really need help on this one.

Let me break this down I have two BST, one to hold all the letter of the alphabet and the other BST, which hold all the words that contains that letter.

My problem is how do I call the 2nd BST within the 1st BST. I want my code to search the first BST for the letter the word began with, and then within that insert method call the second BST insert method.

I hope that make sense.

[roots]

what is BST ?

[Eranga]

May be he is talking about Binary Search Tree root.

[theonly]

Yeah, a BST is a Binary Search Tree, and I'd figured it out. Thanks

[Eranga]

Ok pal, if you have solved your question, please mark it as SOLVED. :)

[Zosden]

could you please post your solution so that if others have the same problem they can refer back to this thread instead of creating a new one. That is how the forums are suppose to work.

[Eranga]

That's a grate idea Zosden. ;)

[theonly]

Ok, the quick and dirty explanation is to make your primary BST have a BST container ie:

private class Node{
Node left, right;
String data;
BST secondaryBST = new BST();
}

and then whenever you want to have access to the secondary BST method just use a code like "node.secondaryBST.method()"
I hope that make sense, if anyone need more explanation just let me know.