I have an issue about proving the next problem:
Let's define a BVL tree, which is a binary tree, who satisfied the feature that the difference between the heights of the children of a node, is at most 2.
Meaning|height(node.left) - height(node.right)| <= 2 Prove that BVL tree is a balanced tree.
Now I do know it's some kind of extension of AVL tree. Well, as we know, the defenition of a balanced tree is related to its height, which is O(logn)
However, trying to perform an induction on N for BVL tree, ends with failure..
Can someong turn on the light and give me a hint?