What does the below definations convey? i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.

• A. n ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.
• B. weight balanced and height balanced tree definations
• C. height balanced and weight balanced tree definations
• D. definations of weight balanced tree
• E. definations of height balanced tree