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.
文中结合完全二叉树结构，提出了一种新的基于身份的群密钥协商协议。
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.
在一棵完全二叉树的每一层，除最后一层外，其余各层都是填满的，并且最后一层的节点尽可能的靠左排列。
However, often heap implementations choose to ensure the heap condition in such a way that the resulting binary tree is complete.
然而，通常选择确保堆堆实现条件的方式生成的二叉树就完成了。
However, often heap implementations choose to ensure the heap condition in such a way that the resulting binary tree is complete.
然而，通常选择确保堆堆实现条件的方式生成的二叉树就完成了。
应用推荐