ScholarLens Back to search
2001•Journal of North China Institute of TechnologyRequires access

The Proof and Realization of Uniqueness in Constructing Binary Tree

Jing Liu

Open publisher page 0 citations

Abstract

Aim To reveal the relationship between a binary tree and its traversal sequence. Methods Mathematic induction method is used. Results and Conclusion The preorder traversal sequence and midorder traversal sequence can be used to contruct a binary tree uniquely. Moreover, the program in VC is given.

About this research paper

What this paper is about

Aim To reveal the relationship between a binary tree and its traversal sequence. Methods Mathematic induction method is used. Results and Conclusion The preorder traversal sequence and midorder traversal sequence can be used to contruct a binary tree uniquely. Moreover, the program in VC is given.

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

Aim To reveal the relationship between a binary tree and its traversal sequence. Methods Mathematic induction method is used. Results and Conclusion The preorder traversal sequence and midorder traversal sequence can be used to contruct a binary tree uniquely. Moreover, the program in VC is given.

Key concepts: Tree traversal, Preorder, Binary expression tree, Graph traversal, Binary tree, Sequence (biology), Binary number, Uniqueness

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Proof and Realization of Uniqueness in Constructing Binary Tree — Research Paper | ScholarLens