A priority-queue is implemented as a max-heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8, 5, 3, 2 two new elements 1 and 7 are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
Answers
Answered by
1
Answer:
Initially heap has 10, 8, 5, 3, 2
10
/ \
8 5
/ \
3 2
After insertion of 1
10
/ \
8 5
/ \ /
3 2 1
No need to heapify as 5 is greater than 1.
After insertion of 7
10
/ \
8 5
/ \ / \
3 2 1 7
Heapify 5 as 7 is greater than 5
10
/ \
8 7
/ \ / \
3 2 1 5
No need to heapify any further as 10 is
greater than 7
Answered by
0
Data Manipulation Language (DML) operations such as INSERT, UPDATE, and DELETE can be parallelized by Oracle. Parallel execution can speed up large DML operations and is particularly advantageous in data warehousing environments where it's necessary to maintain large summary or historical tables. In OLTP systems, parallel DML sometimes can be used to improve the performance of long-running batch jobs.
Similar questions