binary search tree — in Uzbek

ikkilik daraxti

ikkilik (izlash) 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 uchi bilan izlash kalitining qandaydir qiymati bogʻlangan, uning chap daraxtida barcha kalitlar kam, oʻng daraxtida esa koʻp boʻladigan tarzda bogʻlangan ikkilik daraxt.

Open the dictionary entry

People search for: binary search tree in Uzbek · binary search tree uzbek tilida · binary search tree o'zbekcha · binary search tree tarjimasi · binary search tree на узбекском