Balanced search tree. 2-3 tree
Balanced search tree’da biz binary search tree’ning uzunligini kamaytirish hisobiga, worst case’ni O (log N) gacha tushiramiz.
Kalit so'z: 2-3 search tree
Dasturchi, frilanser, gik va introvert