Kalit so'z: balanced search tree

Balanced search tree’da biz binary search tree’ning uzunligini kamaytirish hisobiga, worst case’ni O (log N) gacha tushiramiz.