Complete Binary Tree Nodes and Leaves Number Relation;

In this paper,a new coding scheme was proposed,which was based on the sequence of its complete binary tree.

Combined with complete binary tree architecture,a new identity-based group key agreement protocol is proposed in this paper.

We considering the effect of the ratio of single moving time to single comparison time on the time consumption of Heap-sort algorithm,and by improving the standard Heap-sort algorithm,an adaptive Heap-sort algorithm based on complete k-ary tree is proposed,in which an adaptive parameter k is applied.

A simple and convenient method to judge a fully binary tree;

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.

Basing on the model-theoretic properties of having algebraically prime models and being simply closed for first-order theories,we present new proofs for quantifier elimination of theories of complete forked trees,including theory of complete k(k<ω)-ary trees and of complete infinite-ary trees, which simplify original proofs extremely.