+1 vote
in Data Structures & Algorithms I by (110k points)
Which algorithm is used in the top tree data structure?

(a) Divide and Conquer

(b) Greedy

(c) Backtracking

(d) Branch

My question comes from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I

This question was addressed to me in examination.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right answer is (a) Divide and Conquer

The best explanation: Top tree is a type of data structure which is based on unrooted dynamic binary tree and is used to solve path related problems. It allows an algorithm called divide and conquer.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.