Suppose we have a hash table with N slots containing n keys. Suppose that instead of a linked list in open hashing, each slot is implemented as a binary search tree. Give the worst and the best time complexity of adding an entry to this hash table. Explain your answers. n adet anahtar yerletirmek iin N adet blme olan bir hash tablosu olduunu dnelim. Open hashing de kullanlan bal liste yerine, her bir blmede ikili arama aa kullanlacaktr. Buna gre hash tablosuna bir eleman eklemenin en iyi ve en kt durum karmaklarn veriniz. Best Case Se... Worst Case Se