heap tree кўринишдаги бинар дарахтлар

PPTX 577.0 KB Free download

Page preview (5 pages)

Scroll down 👇

1733481708.pptx /docprops/thumbnail.jpeg heap tree кўринишдаги бинар дарахтлар heap tree куринишдаги бинар дарахтлар 1 25, 20, 17, 16, 19, 16, 22, 21, 24, 23, 34, 30, 31, 29, 38, 35, 36, 40, 39, 44 a) cверху вниз preorder (r, l, r): 25, 20, 17, 16, 19, 22, 21, 24, 23, 34, 30, 29, 31, 38, 35, 36, 40, 39, 44 b) cимметричный in order (l, r, r): 16, 17, 19, 20, 21, 22, 23, 24, 25, 29, 30, 31, 34, 35, 36, 38, 39, 40, 44 c) снизу вверх postorder (l, r, r): 16, 19, 17, 21, 23, 24, 22, 20, 29, 31, 30, 30, 36, 35, 39, 44, 40, 38, 34, 25 tree ma’lumotlar tuzilmasi. binary tree tree – chiziqli bo’lmagan ma’lumot tuzilmasi (data structure) bo’lib u ma’lumotlarni ierarxik ko’rinishda tashkil qiladi. masalan, oila shajarasini tasavvur qiladigan bo’lsak, u ham tree ma’lumot tuzilmasi hisoblanadi. shajara – tree malumotlar tuzulmasi sifatida …

ta (yoki eng kichik) elementni topishda time complexity o(n) bo’lib ketayotgan edi. tartiblangan array uchun esa, eng katta (eng kichik) elementni topish o(1) bo’ladi, lekin bunda array element qo’shganimizda har safar array’ni tartiblashga majbur bo’linardi – o(n log n). demak, binary heap priority queue’dan ko’ra samaraliroq ishlaydi. qo’shish va o’chirish – binary tree’dagi kabi o (log n). binary heap’ning kamchiligi – u faqat eng katta (eng kichkina) elementlarni tezda topish imkonini beradi. boshqa qiymatdagi elementlarni topish uchun heapni «titkilab» chiqish kerak. sababi binary heap – tartiblanmagan. tabiiyki tartiblanmagan ro’yhatdan qidirish o(n) vaqtni oladi. masalan yuqoridagi rasm’dan 30 sonini topish uchun heap’ning hamma elementlari tekshirib chiqish kerak bo’ladi. kodda ifodalash binary heap uchun double pointer’li linked list ishlatish shartmas. shunchaki array bilan ham ifodalasa bo’ladi. amallar osonroq bo’lishi uchun array[0] ni bo’sh qoldiramiz, keyin heap qiymatlarini kiritamiz. bizda max heap’ni kodda ifodalash const array = [null, 100, 70, 80, 20, 30, …

blings 4.e, f, h, i va j – leaves binary tree tree node’lari bo’lmasligi yoki bitta va undan ko’p bo’lishi mumkin. binary tree‘da node’lar ikkitadan ko’p bo’lmaydi. har bir node’da chap va o’ng node bo’lishi mumkin. binary tree node’lari asosan 3 turdagi ma’lumotlarni o’zida saqlaydi: 1.node’ning qiymati (value) 2.chap child’ga ko’rsatkich (pointer) 3.o’ng child’ga ko’rsatkich (pointer) binary tree turlari dasturlashda asosan binary tree ko’p ishlatiladi. uning bir necha turlari bor: full binary tree. har bir node 0 yoki 2 children node’ga ega bo’lgan binary tree. full va full bo’lmagan binary tree. binary tree’ning ohirgi darajasidan tashqari qolgan har bir darajasi tugallangan bo’lsa, u complete binary tree deyiladi . perfect binary tree. agar barcha internal node’larda ikkitadan child bo’lsa va barcha external childlar bir darajada bo’lsa, demak u perfect binary tree bo’ladi. balanced binary tree. agar binary tree’ning uzunligi (height) o(log n) bo’lsa, balanced binary tree deyiladi. bunda n – tree’dagi …

heap tree кўринишдаги бинар дарахтлар - Page 4

heap tree кўринишдаги бинар дарахтлар - Page 5

Want to read more?

Download the full file for free via Telegram.

Download full file

About "heap tree кўринишдаги бинар дарахтлар"

1733481708.pptx /docprops/thumbnail.jpeg heap tree кўринишдаги бинар дарахтлар heap tree куринишдаги бинар дарахтлар 1 25, 20, 17, 16, 19, 16, 22, 21, 24, 23, 34, 30, 31, 29, 38, 35, 36, 40, 39, 44 a) cверху вниз preorder (r, l, r): 25, 20, 17, 16, 19, 22, 21, 24, 23, 34, 30, 29, 31, 38, 35, 36, 40, 39, 44 b) cимметричный in order (l, r, r): 16, 17, 19, 20, 21, 22, 23, 24, 25, 29, 30, 31, 34, 35, 36, 38, 39, 40, 44 c) снизу вверх postorder (l, r, r): 16, 19, 17, 21, 23, 24, 22, 20, 29, 31, 30, 30, 36, 35, 39, 44, 40, 38, 34, 25 tree ma’lumotlar tuzilmasi. binary tree tree – chiziqli …

PPTX format, 577.0 KB. To download "heap tree кўринишдаги бинар дарахтлар", click the Telegram button on the left.

Tags: heap tree кўринишдаги бинар дар… PPTX Free download Telegram