Yanjun Zhang
Abstract
We expatiate on the relationship between the binary tree and binary sort tree through an instance,and present a method to form the binary tree fast and accurately based on the relationship between the binary tree and binary sort tree.Furthermore,we prove that the method is right in theory.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We expatiate on the relationship between the binary tree and binary sort tree through an instance,and present a method to form the binary tree fast and accurately based on the relationship between the binary tree and binary sort tree.Furthermore,we prove that the method is right in theory.
Key concepts: Random binary tree, Optimal binary search tree, Binary tree, Self-balancing binary search tree, Binary expression tree, sort, K-ary tree, Tree (set theory)