Remove method for Ternary Search Tree
Hi,
After spending the last 8 hours trying to implement the "remove" method for Ternary Search Tree, I came to the sad realization that the algorithm is just way too complicated to implement (not the insertion or search methods though) -- there are just way too many scenarios to consider. Before I go into the details of how I am attempting to write the "remove" method, I wanted to ask whether anyone knows or done such method for TST so I don't end up reinventing the wheel?
Thank You

