On Fri, Nov 13 1998, Renato spake thus:
> Why not use something like a binary tree: You can then include some extra
> code to enable your tree to perform rotations ie res-balck tree. this will
> enable your tree to use a binary search method and guarantee O(logN) search
> & insert times.
> l have only included the code for an ordinary BST tree, to convert it to a
> balanced BST tree is not that difficult. You need to see if the data you are
> entering is sufficently random order that perhaps a fully balanced tree will
> not be warrented as on the average a random input of data will enable a
> reasonably balanced tree.
aiiee! english please :). i'll have to go read up on binary trees, i havent
ever touched them. my linked lists aren't too hot either.
its time i learnt how they work, and understand them well.
leon
--
Leon Breedt | Codewarrior | Debian 2.0 | Linux 2.1.127
PGP key and homepage at http://ejb.www.icon.co.za
Linux: Because I want to get there *today*
