J
JayM
I've been working on Binary trees recently and now i want
to make a node that contains a String (what will be used
to sort) and a Tree inside. This second tree will contain
a string.
Here is how it works :
In the 1st tree, if you insert the name "John" and in the
2nd tree where "John" is you insert "Jim", and when you
want to insert another "John" in the 1st tree, it will
find the node that contains "John" and will add the 2nd
value to the tree inside the node without overwriting.
Sad part is that i'm having a lot of trouble tring to
figure how to put the tree inside the node and how not to
make it overwrite the current Tree with values in it.
Thx for any kind of help
JayM
to make a node that contains a String (what will be used
to sort) and a Tree inside. This second tree will contain
a string.
Here is how it works :
In the 1st tree, if you insert the name "John" and in the
2nd tree where "John" is you insert "Jim", and when you
want to insert another "John" in the 1st tree, it will
find the node that contains "John" and will add the 2nd
value to the tree inside the node without overwriting.
Sad part is that i'm having a lot of trouble tring to
figure how to put the tree inside the node and how not to
make it overwrite the current Tree with values in it.
Thx for any kind of help
JayM