Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
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 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
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.
