Width of a Binary Tree | Zendy

Nishant Doshi | Zendy; Tarun Sureja | Zendy; Bhavesh Akbari | Zendy; Hiren Savaliya | Zendy; Viraj Daxini | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Width of a Binary Tree

Author(s) -

Nishant Doshi,

Tarun Sureja,

Bhavesh Akbari,

Hiren Savaliya,

Viraj Daxini

Publication year - 2010

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/1355-1829

Subject(s) - computer science , binary number , tree (set theory) , binary tree , algorithm , arithmetic , mathematics , combinatorics

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. General Terms Algorithms

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research