Searching (cont)
Maintaining the order in sorted arrays and files is a costly operation.
Search trees are as efficient to search but more efficient to maintain.
Example: the following tree corresponds to the sorted array [2,5,10,12,14,17,20,24,29,30,31,32] :
|