From: Einar K. <eka...@cs...> - 2001-07-09 16:31:39
|
Hello Currently have minimal alpha implementations of binary search trees and splay trees. There are small problems with cursors however. The library doesn't seem to like a structute supporting multiple cursor (it results in problems with next_cursor etc). Does anyone know a solution to this. Cursor validity is also a problem, when a tree is rotated then all/none of the cursors are must be invalidated because keeping track of cursors any other way would result in a very slow container. If someone has time please check the alpha out (http://beeblebrox.edu.hel.fi/~einar/tree). It needs much refining, but should have some of the basic functionality. I will be completing these classes and adding red-black trees in a couple of weeks. When you notice something to correct please send me email. - Einar Karttunen |