dev-cpp-users

Re: [Dev-C++] binary tree search + need to find char*

[Peter M. <pet...@im...>]

Thanks for the book advice, i was looking for a good reference and I
have not yet ventured into STL.
I also feel that the advice about having a balanced tree may be very
appropriate, although the size of the tree should not be problematic at
the moment as there are only a few hundred nodes.

If the binary tree was balanced then code like this should work i hope:
///////////////////////////////////////////////////  
DicTreeNode* DicBinaryTree::wordBTreeSearch(DicTreeNode* nodePtr, char*
dicWord ){ 
if (nodePtr != 0) { 
if (strcmp(nodePtr->word,dicWord) < 0) { 
this->wordBTreeSearch(nodePtr->leftChild,dicWord);
}
if (strcmp(nodePtr->word,dicWord) > 0) { 
this->wordBTreeSearch(nodePtr->rightChild,dicWord); 
}
else { 
this->rtnNodePtr = nodePtr; 
} 
return this->rtnNodePtr; 
} 
else{ 
return nodePtr = 0; 
} 
} 
//////////////////////////////////////////////////// 
?

Peter Mead

Re: [Dev-C++] binary tree search + need to find char*

[Hossein H. <ult...@em...>]

Dear Peter,

> Thanks for the book advice, i was looking for a good reference and I
> have not yet ventured into STL.

Feel free to read through Accelerated C++. I use to teach it to my
newbie CS students who even do not know anything about OOP. That's
because the book not only has supposed that you are not an experienced
C++ programmer, but also it assumes that you even do not know C (the
assumption many of old books used to do).

It starts from scratch, but reaches to the intermediate-high levels.
Perhaps, it is astonishing for anybody (including you) that it uses
STL from the very beginery levels. And that's the real magic of this
book that makes it to be so succesful.

It is more than 5 years that I've taught C++ in university and I have
tested several books, but this one is really fabulous, apart from the
rest.

> I also feel that the advice about having a balanced tree may be very
> appropriate, although the size of the tree should not be problematic at
> the moment as there are only a few hundred nodes.

If you use the std::map<> you don't have to worry about these issues
at all, as it is mentioned in the Standard that the implementations
have to have algorithms run on it with the logarithmic runtime.

According to the Standard (C++ Standardisation Commitee), it is
guaranteed that std::map<> is always balanced.

Regards,
--Hossein
-- 
__________________________________________________________
Sign-up for your own FREE Personalized E-mail at Mail.com
http://www.mail.com/?sr=signup

CareerBuilder.com has over 400,000 jobs. Be smarter about your job search
http://corp.mail.com/careers