An AVL tree is one that satisfies the height-balance property which states that: For every position p of T, the heights of the children of p differ by at most 1.
Below is an example AVL tree. However, I've highlighted a node whose child's height would imply that their difference is not at most 1.
Can someone explain to me what I am missing?