What are the applications of weight balanced tree?
(a) dynamic sets, dictionaries, sequences, maps
(d) storing strings
This intriguing question originated from Weight Balanced Tree in chapter Binary Trees of Data Structures & Algorithms I
This question was posed to me in semester exam.
Right answer is (a) dynamic sets, dictionaries, sequences, maps
Explanation: They are a type of self balancing trees which are mostly used in storing key-value pairs, which is mostly used in functional programming languages. they are very useful to maintain big set of ordered objects.