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

单词	BalancedTree
释义	balanced tree A balanced tree is a rooted tree where no leaf is much fartheraway from the root than any other leaf.Different balancing allow different definitions of ”much farther” anddifferent amounts of work to keep them balanced. For an example, see binary tree.
随便看	RomanNumerals Roman numerals RonaldGraham Ronald Graham Root root root(2,n) is irrational for n≥3 (proof using Fermat’s last theorem) Rootdiscriminant root-discriminant RootLattice root lattice Rootmeansquare root-mean-square RootofATree root (of a tree) RootOfUnity root of unity RootSystem root system RootSystemUnderlyingASemisimpleLieAlgebra root system underlying a semi-simple Lie algebra RosettaBiogroupoids Rosetta biogroupoids RotationalInvarianceOfCrossProduct rotational invariance of cross product

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

balanced tree