Enhancing Biparental Heap and Rotated List

Vote count:

0

Heap is efficient when it comes to insert and delete but for search operation it requires O(n) comparisons. To improve on searching we modify heap and create biparental heap (beap) in which every node has two parents. Rest all aspects are same as heap.Searching in beap takes O(sqrt(2n)) comparisons.

Can someone explain me how can we further reduce the time spent on searching on arbitrary node by making some modifications to beap.

Thanks in advance.

asked 1 min ago

arya

1

Enhancing Biparental Heap and Rotated List