Use a sorted array if deletions and insertions are not going to happen often (or never). Otherwise a balanced binary search tree is usually more appropriate.

SIAM Journal on Applied Mathematics, Vol. 25, No. 1 (Jul., 1973), pp. 83-94 (12 pages) An algorithm for constructing an alphabetic binary tree of minimum weighted path length was suggested by Hu and ...