A binary tree is balanced if the difference between left and right subtree of every node is not more than ____

(a) 1

(b) 3

(c) 2

(d) 0

The question is from Binary Trees in portion Binary Trees of Data Structures & Algorithms I

I got this question during an online exam.