What are the operations that can be performed on weight balanced tree?

(a) all basic operations and set intersection, set union and subset test

(b) all basic operations

(c) set intersection, set union and subset test

(d) only insertion and deletion

My enquiry is from Weight Balanced Tree topic in section Binary Trees of Data Structures & Algorithms I

I got this question in quiz.

1 Answers

The correct answer is (a) all basic operations and set intersection, set union and subset test

Explanation: The speciality of a weight balanced tree is a part from basic operations we can perform collective operations like set intersection, which helps in rapid prototyping in functional programming languages.