I have some confusion with regards to AVL trees and the heights of various subtrees.
When initially reading the overview of the algorithms purpose(to keep the tree balanced) I thought it put limits on the maximum height difference between the shortest path and the longest path in the tree - my initial understanding is that they could only have a difference of 1.
But after re-reading this no longer appears to be the case? The description given on Wikipedia is the difference between the height of the left and right trees must only be a difference of 1 but this allows for subtrees with shorter paths.
What's going on?