ScholarLens Back to search
2010•Journal of Nanchang Hangkong UniversityRequires access

Non-recursive Algorithm of Restoring a Binary Tree by Preorder Traversal and Postorder Traversal

Gang Zhao

Open publisher page 0 citations

Abstract

There has been a conclusion that the preorder traversal sequence and the postorder traversal sequence cannot restore a unique binary tree in the first literature.In the paper it has been pointed out and proved that preorder traversal sequence and the postorder traversal sequence can restore a unique binary tree under certain conditions.That is,the degree of binary tree is zero or two.The viewpoint has been illuminated in this paper.The non-recursive algorithm has been implemented in Visual C++ 6.0.

About this research paper

What this paper is about

There has been a conclusion that the preorder traversal sequence and the postorder traversal sequence cannot restore a unique binary tree in the first literature.In the paper it has been pointed out and proved that preorder traversal sequence and the postorder traversal sequence can restore a unique binary tree under certain conditions.That is,the degree of binary tree is zero or two.The viewpoint has been illuminated in this paper.The non-recursive algorithm has been implemented in Visual C++ 6.0.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

There has been a conclusion that the preorder traversal sequence and the postorder traversal sequence cannot restore a unique binary tree in the first literature.In the paper it has been pointed out and proved that preorder traversal sequence and the postorder traversal sequence can restore a unique binary tree under certain conditions.That is,the degree of binary tree is zero or two.The viewpoint has been illuminated in this paper.The non-recursive algorithm has been implemented in Visual C++ 6.0.

Key concepts: Tree traversal, Preorder, Graph traversal, Binary tree, Sequence (biology), Tree (set theory), Binary number, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Non-recursive Algorithm of Restoring a Binary Tree by Preorder Traversal and Postorder Traversal — Research Paper | ScholarLens