Q251
Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
A.
insertion takes less time
AnswerB.
deletion takes less time
C.
searching takes less time
D.
construction of the tree takes less time than binary heap
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board