notnorwegian at yahoo.se writes: > im writing a webcrawler. > after visiting a new site i want to store it in alphabetical order. > so obv i want fast insert. i want to delete duplicates too. > which datastructure is best for this? Nobody has mentioned balanced-tree data structures so you might want to look them up.