AVL tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "AVL tree" in English language version.

refsWebsite
Global rank English rank
5th place
5th place
2nd place
2nd place
6th place
6th place
1st place
1st place
1,045th place
746th place
low place
low place
179th place
183rd place
1,983rd place
1,330th place
69th place
59th place
11th place
8th place
355th place
454th place
274th place
309th place
3,142nd place
2,072nd place

archive.org

arxiv.org

doi.org

nist.gov

xlinux.nist.gov

semanticscholar.org

api.semanticscholar.org

springer.com

link.springer.com

stackexchange.com

cs.stackexchange.com

  • AVL trees are not weight-balanced? (meaning: AVL trees are not μ-balanced?)
    Thereby: A Binary Tree is called -balanced, with , if for every node , the inequality
    holds and is minimal with this property. is the number of nodes below the tree with as root (including the root) and is the left child node of .

stanford.edu

taylorfrancis.com

web.archive.org

  • Eric Alexander. "AVL Trees". Archived from the original on July 31, 2019.

wisc.edu

pages.cs.wisc.edu

  • Eric Alexander. "AVL Trees". Archived from the original on July 31, 2019.

worldcat.org

search.worldcat.org

zhjwpku.com