I made an auto complete text box for an application I'm working on. The text box basically has an associated list that it searches each time you enter something in the box.
If you enter something that is not in the box and hit 'OK', the item is added to that associated list in it's sorted position using a binary insert (basically binary search for the correct position).
Right now I'm using an ArrayList to store the data and a binary search to search. My question is this: in terms of time complexity, is ArrayList the best option for for this situation? Or am I better off using some kind of binary search tree?