Can someone please explain to me how the Wikipedia example on the left for a balanced binary tree is correct?
One common balanced tree structure is a binary tree structure in which the left and right subtrees of every node differ in height by no more than 1
ABCDE, isn't the height of left subtree 2 and the height of the right subtree 0, making the difference of height 2?
EDIT As David rightly pointed out:
That page defined "balanced" immediately above the example you're asking about, and it defines balanced in a different way to you.
I thought that the example was using the definition that comes immediately after the example, which I have quoted above. Apologies for the confusion.