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

单词	AVLTree
释义	AVL tree An AVL tree is a balanced binary search tree where the height of the twosubtrees (children) of a node differs by at most one. Look-up, insertion, anddeletion are $O(\\ln{n})$ , where $n$ is the number of nodes in the tree. The structure is named for the inventors, Adelson-Velskii and Landis (1962).
随便看	therefore sign ThereIsAUniqueReducedFormOfDiscriminant4nOnlyForN12347 there is a unique reduced form of discriminant -4⁢n only for n=1,2,3,4,7 The Rezk completion TheRingOfIntegersOfANumberFieldIsFinitelyGeneratedOvermathbbZ the ring of integers of a number field is finitely generated over ℤ TheSetOfAllRealTranscendentalNumbersIsUncountable the set of all real transcendental numbers is uncountable TheSetOfPrimeIdealsOfACommutativeRingWithIdentity the set of prime ideals of a commutative ring with identity TheSphereIsIndecomposableAsATopologicalSpace the sphere is indecomposable as a topological space The structure identity principle TheSumOfTheValuesOfACharacterOfAFiniteGroupIs0 the sum of the values of a character of a finite group is 0 The surreal numbers The Theory Behind Taylor Series TheTheoryBehindTaylorSeries1 TheTop10MostBeautifulTheorems the top 10 most beautiful theorems TheTopologistsSineCurveHasTheFixedPointProperty the topologist’s sine curve has the fixed point property TheTorsionSubgroupOfAnEllipticCurveInjectsInTheReductionOfTheCurve the torsion subgroup of an elliptic curve injects in the reduction of the curve The type of booleans

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

AVL tree