However inserting and removing elements should be faster. So when do you use sorted arrays and when do you used binary trees? Do you have any rules of thumb? I guess that for small number of elements.