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
Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!