Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGhosh, Sumit Kumar
dc.contributor.authorGhosh, Joydeb
dc.contributor.authorPal, Rajat Kumar
dc.identifier.issn0972-8791 (Print)
dc.description.abstractIn this paper we have developed an algorithm that converts a given k-ary tree, for any k ≥ 3, to its equivalent binary tree structure. The binary tree is generated in O(n) time, for a k-ary tree with a total of n nodes. The algorithm is designed aiming at reducing the height of the constructed binary tree. The constructed tree does not contain any free links in the non-leaf nodes. That means the constructed tree is like a complete binary tree, where only leaves have no children, and nodes other than leaf nodes contain child (children) and some other valid information of the given k-ary tree.en_US
dc.publisherVidyasagar University , Midnapore , West-Bengal , Indiaen_US
dc.relation.ispartofseriesJournal of Physical Science;Vol 12 [2008]
dc.subjectBinary treeen_US
dc.subjectk-ary treeen_US
dc.subjectTree conversionen_US
dc.titleA New Algorithm to Represent a Given k-ary Tree into Its Equivalent Binary Tree Structureen_US
Appears in Collections:Journal of Physical Sciences Vol.12 [2008]

Files in This Item:
File Description SizeFormat 
JPS12-24.pdf304.92 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.