maintainis dependent on the circumstances the following table shows comparison of the average time complexities for the different possible implementations of the table interfacesorted array balanced bst hash table search (log no(log no( insert (no(log no( delete (no(log no( traverse (no(no(nlog nhash tables are seen to perform rather wellthe complexity of searchingupdating and retrieving are all independent of table size in practicehoweverwhen deciding what approach to useit will depend on the mix of operations typically performed for examplelots of repeated deletions and insertions can cause efficiency problems with some hash table strategiesas explained above to give concrete exampleif there are entries in balanced binary search treeit takes on average comparisons to complete successful search on the other handwe can need as few as comparisons if we use hash tableprovided that we keep its load factor below percent of coursedespite their time advantagewe should never forget that hash tables have considerable disadvantage in terms of the memory required to implement them efficiently