This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
The definition of α-weight-balanced here is incorrect in the corner case that a node has only one child; the left-weight or the right-weight must be 0, so a 2-node tree is inherently imbalanced.-72.177.84.81 (talk) 01:23, 13 April 2016 (UTC)Reply
weight := size + 1, so the empty tree has weight 1, and a 2-node tree is α-weight-balanced whenever α <= 1/2. Zigswatson (talk) 20:36, 3 December 2016 (UTC)Reply