“CompleteBinaryTree”的概念、定义、习题解题方法及翻译-数学辞典

单词	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.)
随便看	corollary of Kummer’s theorem CorollaryOfMorleysTheorem corollary of Morley’s theorem CorollaryOfSchurDecomposition corollary of Schur decomposition CorollaryToTheCompositumOfAGaloisExtensionAndAnotherExtensionIsGalois corollary to the compositum of a Galois extension and another extension is Galois CorrespondenceBetweenNormalSubgroupsAndHomomorphicImages correspondence between normal subgroups and homomorphic images CorrespondenceOfNormalSubgroupsAndGroupCongruences correspondence of normal subgroups and group congruences CorrespondingAnglesInTransversalCutting corresponding angles in transversal cutting Coset coset CosineAtMultiplesOfStraightAngle cosine at multiples of straight angle CosinesLaw cosines law CotangentBundle cotangent bundle CotangentBundleIsABundle cotangent bundle is a bundle CotriangularSpace cotriangular space

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。

complete binary tree