Let T be a full binary tree with depth d (1 [less than or equal to] d [less than or equal to] n), where the leaf stands for user.
Algorithm B initials a full binary tree T of depth d (1 [less than or equal to] d [less than or equal to] n), and all the node in T is numbered from 1 to ([2.sup.d] - 1).
From the full binary tree T, user path is denoted as path(uid) = [mathematical expression not reproducible]}.
* If the binary tree which degree is n has 2^n - 1 nodes, then it is called a full binary tree
. Full binary tree
is also called complete binary tree.
Binary tree with n nodes, the full binary tree
or a complete binary tree with minimum path length, the length of the binary tree with the right path:
The full binary tree [T.sub.h] of height h can be defined as the rooted plane tree such that:
A binary tree is a subtree of a full binary tree with the same root.
We consider finite full binary trees
in which every node has zero or two children.