Sriyati , Sriyati (1990) Binary tree untuk masalah huffman dan masalah yosehus. Undergraduate thesis, FMIPA UNDIP.
![[img]](/style/images/fileicons/application_pdf.png) | PDF Restricted to Repository staff only 1836Kb | |
| PDF 20Kb | |
| PDF 209Kb | |
| PDF 315Kb | |
| PDF 231Kb | |
| PDF 469Kb | |
| PDF 558Kb | |
| PDF Restricted to Repository staff only 532Kb | |
| PDF Restricted to Repository staff only 408Kb | |
| PDF 221Kb | |
| PDF 207Kb |
Abstract
Binary Tree adalah Tree .yang mem[Dunyai syarat 1 tertentu yaitu hanya sate vertek yang mempu nyai degree; 2 sedangkan vert4 yang lain mempunyai degree 1 atau 3. 1 .! Disini yang dibicarakan adalah penggunaan Binary Tree untuk menyelesaiiian masalah 1 Huffman dan masaiah Yosephus. This: document is Unclip Institutional RepOsitory Collection. The E ,$) or copyright owners) - agree that UNUIP-Ik may, changing the content, translate the submission toi any medium or format for the Ourpose Of preservation. The author:(s) or NIflIP IR Hm•nr, rrnr,n ihrenic,inn
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
| ID Code: | 31215 |
| Deposited By: | Mr UPT Perpus 1 |
| Deposited On: | 17 Nov 2011 07:46 |
| Last Modified: | 17 Nov 2011 07:46 |
Repository Staff Only: item control page
