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

[507 byte] By [aria_kokoschkaa] at [2007-11-27 11:19:17]
# 1

Pardon my French but this method was a bi*ch to implement -- finally got it working. Wrote an extensive set of test cases to make sure it works. I wonder if there is a clear cut algorithm base on some sort of graph theory for removing nodes in Ternary Search Tree!

aria_kokoschkaa at 2007-7-29 14:35:52 > top of Java-index,Core,Core APIs...