complete binary tree

A complete binary tree is a binary tree with the additional property that every node must have exactly two “children” if an internal node, and zero children if a leaf node.

More precisely: for our base case, the complete binary tree of exactly one node is simply the tree consisting of that node by itself. The property of being “complete” is preserved if, at each step, we expand the tree by connecting exactly zero or two individual nodes (or complete binary trees) to any node in the tree (but both must be connected to the same node.)

单词	CompleteBinaryTree
释义	complete binary tree A complete binary tree is a binary tree with the additional property that every node must have exactly two “children” if an internal node, and zero children if a leaf node. More precisely: for our base case, the complete binary tree of exactly one node is simply the tree consisting of that node by itself. The property of being “complete” is preserved if, at each step, we expand the tree by connecting exactly zero or two individual nodes (or complete binary trees) to any node in the tree (but both must be connected to the same node.)
随便看	SubdirectProductOfGroups subdirect product of groups SubdirectProductOfRings subdirect product of rings Subdivision subdivision Subfield subfield SubfieldCriterion subfield criterion Subformula subformula Subfunction subfunction SubgoupsOfLocallyCyclicGroupsAreLocallyCyclic subgoups of locally cyclic groups are locally cyclic Subgraph subgraph Subgroup subgroup SubgroupOfAGroupDefinesAnEquivalenceRelationOnTheGroupProofThatA subgroup of a group defines an equivalence relation on the group, proof that a SubgroupOfTopologicalGroupIsEitherClopenOrHasEmptyInterior subgroup of topological group is either clopen or has empty interior SubgroupsContainingTheNormalizersOfSylowSubgroupsNormalizeThemselves