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

A binary tree is balanced if the difference between left and right sub

1.	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
Answer» B. 3