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.

在一棵完全二叉树的每一层，除最后一层外，其余各层都是填满的，并且最后一层的节点尽可能的靠左排列。

youdao

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

文中结合完全二叉树结构，提出了一种新的基于身份的群密钥协商协议。

youdao

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

文中结合完全二叉树结构，提出了一种新的基于身份的群密钥协商协议。

youdao