Analysis of Tree in Computer-based Application
| dc.contributor.author | Sharif, Md. Kamal Ibne | |
| dc.contributor.author | Das, Abhijeet | |
| dc.contributor.author | Hyder, Nazmul | |
| dc.contributor.author | khan, Al Amin | |
| dc.date.accessioned | 2018-10-26T11:37:15Z | |
| dc.date.available | 2018-10-26T11:37:15Z | |
| dc.date.issued | 2018-10-24 | |
| dc.description.abstract | The main target of our thesis “Analysis of Tree in Computer-based Application” was implemented some tree and some algorithm so that we can able to make some computer based applications. The applications will help you to show which algorithm is working first in same dictionary to search any given words. We also show here how to sort many characters by applying heap sort. Here we provide the directory search by using in-order, pre-order, post-order and post-order trees we also show here a Huffman coding techniques. | en_US |
| dc.identifier.uri | http://dspace.uiu.ac.bd/handle/52243/537 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | United International University | en_US |
| dc.subject | Huffman coding techniques. | en_US |
| dc.subject | directory search | en_US |
| dc.subject | Tree | en_US |
| dc.title | Analysis of Tree in Computer-based Application | en_US |
| dc.type | Thesis | en_US |