Please use this identifier to cite or link to this item:
http://ir.mu.ac.ke:8080/jspui/handle/123456789/6049
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wetoyi, Austin Owino | - |
dc.date.accessioned | 2022-03-03T14:03:36Z | - |
dc.date.available | 2022-03-03T14:03:36Z | - |
dc.date.issued | 2016 | - |
dc.identifier.uri | http://ir.mu.ac.ke:8080/jspui/handle/123456789/6049 | - |
dc.description.abstract | It is possible to save a binary tree to a file and restore it at a later time. Because these two operations are frequently necessary and therefore important, an efficient algorithm to represent a binary tree in a compact way is very desirable. For special types of binary trees, there are efficient algorithms, otherwise, there is a method that stores both the inorder and either preorder traversal or postorder traversal of the binary tree which requires two traversals of the binary tree during construction of the storage array. In this paper, I present an approach for which only one traversal is sufficient for construction of the storage array. I also present a more efficient complement algorithm for restoration of the binary tree. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Asian journal of computer and information systems | en_US |
dc.subject | Binary tree | en_US |
dc.subject | Tree traversal | en_US |
dc.subject | Data compression | en_US |
dc.subject | Binary tree linearization | en_US |
dc.title | A single traversal algorithm for serializing any binary tree | en_US |
dc.type | Article | en_US |
Appears in Collections: | School of Information Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Wetoyi O.pdf | 485.77 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.