binary tree(redirected from Complete binary tree)
Also found in: Acronyms.
binary tree[′bīn·ə·rē ′trē]
A rooted tree in which each vertex has a maximum of two successors.
binary treeA data structure in which each node contains one parent and no more than two children. See quad tree and splay tree.