A node of the weight balanced tree has
(a) key, left and right pointers, size
(b) key, value
(c) key, size
(d) key
The doubt is from Weight Balanced Tree topic in section Binary Trees of Data Structures & Algorithms I
This question was addressed to me in an online interview.