Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
Posted: Wed Jul 13, 2022 7:42 pm
a) insertion takes less time
b) deletion takes less time
c) searching takes less time
d) construction of the tree takes less time than binary heap
b) deletion takes less time
c) searching takes less time
d) construction of the tree takes less time than binary heap