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 (Global: 6th place; English: 6th place)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

nist.gov (Global: 355th place; English: 454th place)

xlinux.nist.gov

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 274th place; English: 309th place)

link.springer.com

stackexchange.com (Global: 1,983rd place; English: 1,330th place)

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 (Global: 179th place; English: 183rd place)

taylorfrancis.com (Global: 3,142nd place; English: 2,072nd place)

web.archive.org (Global: 1st place; English: 1st place)

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

wisc.edu (Global: 1,045th place; English: 746th place)

pages.cs.wisc.edu

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

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

zhjwpku.com (Global: low place; English: low place)