A New Algorithm to Represent a Given k-ary Tree into Its Equivalent Binary Tree Structure

Please use this identifier to cite or link to this item: https://ir.vidyasagar.ac.in/jspui/handle/123456789/757

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ghosh, Sumit Kumar
dc.contributor.author	Ghosh, Joydeb
dc.contributor.author	Pal, Rajat Kumar
dc.date.accessioned	2016-12-22T17:09:12Z	-
dc.date.available	2016-12-22T17:09:12Z	-
dc.date.issued	2008
dc.identifier.issn	0972-8791 (Print)
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/757	-
dc.description	253-264	en_US
dc.description.abstract	In 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.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;Vol 12 [2008]
dc.subject	Tree	en_US
dc.subject	Binary tree	en_US
dc.subject	k-ary tree	en_US
dc.subject	Tree conversion	en_US
dc.subject	Algorithm	en_US
dc.title	A New Algorithm to Represent a Given k-ary Tree into Its Equivalent Binary Tree Structure	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.12 [2008]

Files in This Item:

File	Description	Size	Format
JPS12-24.pdf		304.92 kB	Adobe PDF	View/Open