Zhu Tao
Abstract
According to binary tree level traversal principle, this article embarks from fully binary tree's definition and the nature,and proposes a method to judge fully binary tree on the basis of traversing binary tree.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
According to binary tree level traversal principle, this article embarks from fully binary tree's definition and the nature,and proposes a method to judge fully binary tree on the basis of traversing binary tree.
Key concepts: Tree traversal, Random binary tree, Binary tree, Self-balancing binary search tree, Optimal binary search tree, K-ary tree, Interval tree, Binary expression tree