We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Article:Width of a Binary Tree

by Nishant Doshi, Tarun Sureja, Bhavesh Akbari, Hiren Savaliya, Viraj Daxini
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 9 - Number 2
Year of Publication: 2010
Authors: Nishant Doshi, Tarun Sureja, Bhavesh Akbari, Hiren Savaliya, Viraj Daxini
10.5120/1355-1829

Nishant Doshi, Tarun Sureja, Bhavesh Akbari, Hiren Savaliya, Viraj Daxini . Article:Width of a Binary Tree. International Journal of Computer Applications. 9, 2 ( November 2010), 41-43. DOI=10.5120/1355-1829

@article{ 10.5120/1355-1829,
author = { Nishant Doshi, Tarun Sureja, Bhavesh Akbari, Hiren Savaliya, Viraj Daxini },
title = { Article:Width of a Binary Tree },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 9 },
number = { 2 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 41-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume9/number2/1355-1829/ },
doi = { 10.5120/1355-1829 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:58:07.448861+05:30
%A Nishant Doshi
%A Tarun Sureja
%A Bhavesh Akbari
%A Hiren Savaliya
%A Viraj Daxini
%T Article:Width of a Binary Tree
%J International Journal of Computer Applications
%@ 0975-8887
%V 9
%N 2
%P 41-43
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Till current date in majority books on algorithm and research papers, they talk about height of a binary tree in terms like height balanced binary tree. In this paper the notion of width of a binary tree has been introduced and later the recursive algorithm based on the traversal techniques of the binary tree is given. Later the iterative version of algorithm using the notion of stack is introduced. The width of a binary tree is defined based on the number of nodes at every level. The highest of all is the width of a binary tree. The same concept can be applied to the general tree.

References
Index Terms

Computer Science
Information Sciences

Keywords

Algorithm Binary tree Stack Width