multi set tree count

[mishink7]

i am trying to count the number of instances of the given key value in a multi set tree, but i am not getting the correct output..my code is:

int count( T const& key_value ) const
{
int count=0;
TreeNode<T>*p=root_;
if ( !p )
return 0;
while(p)
{
if (p->value == key_value)
{
count++;
if (p->right->value==key_value)
{
while (p=p->right)
{
if (p->value==key_value)
count++;

}
return count;
}
return count;
}
else if (key_value < p->value)
p=p->left;
else
p=p->right;
}
return count;
}

this is the tree printed sideways...when good-bye is the search key i get 3, which is the correct answer, but when i search for dog, i only get 1...any help would be appreciated..thanks!
zebra
puppy
hello
good-bye
good-bye
good-bye
friend
dog
dog

also how come when i post...it doesnt include the spaces??

[JosAH]

I'd expected some recursion in there as in:

int count(T const& key) { return count(root_, key); }
int count(Treenode<T>* node, T const& key) {
   if (!node) return 0;
   return (node->value == key)+count(node->left, key)+count(node->right, key);
}

No explanation though, I have to leave you something to chew on ;-)

kind regards,

Jos