Which of the dynamic operations are used in Top Tree data structure implementation?
(d) All of the mentioned
My doubt stems from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I
I have been asked this question in an internship interview.
The correct option is (d) All of the mentioned
The explanation is: Link returns a single tree having different vertices from top trees. Cut removes the edge from the top tree. Expose is used to implement queries on top trees. Hence all of the options are used as dynamic operations.