Title of article
A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals
Author/Authors
Aghaieabiane, N Department of Engineering - School of Computer Science, New Jersey Institute of Technology - Newark - New Jersey, the USA , Koppelaar, H Faculty of Electrical Engineering - Mathematics and Computer Science - Delft University of Technology - Delft, The Netherlands , Nasehpour, P Department of Engineering Science - Golpayegan University of Technology, Golpayegan
Pages
13
From page
1
To page
13
Abstract
Binary trees are essential structures in Computer Science.
The leaf (leaves) of a binary tree is one of the most significant
aspects of it. In this study, we prove that the order of
a leaf (leaves) of a binary tree is the same in the main tree
traversals; preorder, inorder, and postorder. Then, we prove
that given the preorder and postorder traversals of a binary
tree, the leaf (leaves) of a binary tree can be determined.
We present the algorithm BT-leaf, a novel one, to detect the
leaf (leaves) of a binary tree from its preorder and postorder
traversals in quadratic time and linear space.
Keywords
Binary tree , Proper binary tree , Preorder traversal , Inorder traversal , Postorder traversal , Time complexity , Space complexity
Journal title
Astroparticle Physics
Serial Year
2017
Record number
2469465
Link To Document