binary search tree — özbek tilida
ikkilik daraxti
ikkilik (izlaş) daraxti · binary search tree · Двоичное дерево (поиска)
A binary tree in which each node is associated with a search-key value, arranged so that all keys in its left subtree are smaller and all keys in its right subtree are larger.
Har bir uçi bilan izlaş kalitining qandaydir qiymati boğlangan, uning çap daraxtida barça kalitlar kam, öng daraxtida esa köp böladigan tarzda boğlangan ikkilik daraxt.
Luğatdagi maqolaQanday qidirişadi: binary search tree in Uzbek · binary search tree uzbek tilida · binary search tree o'zbekcha · binary search tree tarjimasi · binary search tree на узбекском