Probabilistic Splay Tree implementation
Generalized an older implementation I already had, the splay formulas need some improvements. Documentation comes next.
This commit is contained in:
parent
bc055ab803
commit
86deb4e72d
1 changed files with 20 additions and 0 deletions
|
|
@ -211,6 +211,26 @@ PSplaynode
|
|||
psplay_remove_key (PSplay self, void* key);
|
||||
|
||||
|
||||
/**
|
||||
* Delete a node from a splay tree
|
||||
* @param self pointer to the splay tree
|
||||
* @param node node to be removed
|
||||
* Calls the registered delete handler, frees all resources.
|
||||
*/
|
||||
void
|
||||
psplay_delete_node (PSplay self, PSplaynode node);
|
||||
|
||||
|
||||
/**
|
||||
* Delete a node by key from a splay tree
|
||||
* @param self pointer to the splay tree
|
||||
* @param key key of the node to be removed
|
||||
* Calls the registered delete handler, frees all resources.
|
||||
*/
|
||||
void
|
||||
psplay_delete_key (PSplay self, void* key);
|
||||
|
||||
|
||||
enum psplay_order_enum
|
||||
{
|
||||
PSPLAY_PREORDER,
|
||||
|
|
|
|||
Loading…
Reference in a new issue