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.