“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).
随便看	Controlling Linking ControllingLinking1 ControlSystem control system ConvergenceConditionOfInfiniteProduct convergence condition of infinite product ConvergenceCriterionForInfiniteProduct convergence criterion for infinite product ConvergencedivergenceForAnInfiniteProduct convergence/divergence for an infinite product ConvergenceInDistribution convergence in distribution ConvergenceInProbability convergence in probability ConvergenceInProbabilityIsPreservedUnderContinuousTransformations convergence in probability is preserved under continuous transformations ConvergenceInTheMean convergence in the mean ConvergenceOfArithmeticgeometricMean convergence of arithmetic-geometric mean ConvergenceOfASequenceWithFiniteUpcrossings convergence of a sequence with finite upcrossings ConvergenceOfComplexTermSeries convergence of complex term series ConvergenceOfIntegrals

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

AVL tree