Question about glib's balanced binary trees.



I would like to delete the node in a tree with the largest key.  
Is there an easy and fast way to do this?  I didn't see anything
promising when looking over the API docs.  Searching functions
all seem to use specific keys.

Thanks,
-Jim




[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]