a. Construct the max heap & Min heap for the following data elements 97, 88, 66, 55, 95, 48, 66, 35, 48, 62, 77, 25

Q: A = ⟨4,33,6,90,33,32,31,91,90,89,50,33⟩ A is a min heap, convert it to max heap and extract TWO…

A: Here i have prepared written solution as follows:

Q: 1. Draw the result of applying the Rotate-Left operation to node x in the following binary search…

A:

Q: 4. Question 4: A heap has 1000 elements placed as we have discussed in an array with indeces going…

A: To determine which elements in the heap do not have children, we can look at the array…

Q: Construct the binary search tree of the following:   14, 10, 17, 12, 10, 11, 20, 12, 18, 25, 20,…

A: The above are the Binary search tree for the given question In a binary search tree a node must be…

Q: Show a merge of the following skew heaps. (Show each step). h1 h2 19 11 54 39 12 30 61 65 68 30 14…

A: Two given heaps:

Q: What is the depth of a binary heap with 42 nodes? (assume the root is on depth 0)

A: For a binary heap  Maximum no. of nodes will be when all levels are completely full. Total no. of…

Q: 8. Given a sequence of numbers: 19, 6, 8, 11, 4, 5 (I) Draw a binary min-heap (in a tree form) by…

A:

Q: Construct a Binary Search Tree (BST) for the following array elements  [50, 15, 62, 5, 20, 58, 91,…

A: 1. Construct a Binary Search Tree (BST) for the following array elements  [50, 15, 62, 5, 20, 58,…

Q: Create a Max Heap tree given the following input values.  19, 7, 10, 55, 3, 42, 100, 8

A: Max heap : A tree contains a root and left subtree and right subtree. A max heap tree is a complete…

Q: a) Which array out of A, B and C represents a binary heap? Only one answer is right. A- 1 12 23 10…

A:

Q: 3. Draw the binary heap in its tree form from its array form: 0 1 2 3 4 5 6 7 9 10 11 12 8 2 3 4 9|…

A: Below is the answer to above query. I hope this will be helpful.

Q: Given the binary minimum heap below, what does the heap look like after removing the root? 12 1 1 37…

A: Minimum Binary heap:- When the root node of a binary tree bears the tree's smallest key, the binary…

Q: 3. Sort the array A= [10, 15, 11, 12, 6, 28, 19] by using the operation (insertion and deletion) of…

A: This code will run without comment: #include <iostream> using namespace std; void…

Q: Choose the array below which correctly represents the backing store for the following min heap. (14…

A: Answer is option 3) [0,14,55,26,25,57,62,96,67,63]

Q: 27 14 35 10 19 31 42 1. Determine the in-order, pre-order and post-order traversal of the igure…

A: the answers are as follows:-