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.

04-28-2008, 10:31 AM

roots

what is BST ?

04-28-2008, 10:44 AM

Eranga

May be he is talking about Binary Search Tree root.

04-28-2008, 02:42 PM

theonly

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

04-29-2008, 03:48 AM

Eranga

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

04-29-2008, 04:48 AM

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.

04-29-2008, 04:52 AM

Eranga

That's a grate idea Zosden. ;)

04-29-2008, 11:33 PM

theonly

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