Question 5 If we build the Max-Heap tree of the following set of data: [10, 2, 6, 7, 18, 0, -3, 5] Which of the following statements are not true? 3 is the root node and 10 and and 18 are among the leave nodes. O 18 is the root node and 2 and and -3 are among the leave nodes. 18 is the root node and 7 and and -3 are among the leave nodes. O 18 is the root node and 7 and and 10 are among the leave nodes.

Question 5 If we build the Max-Heap tree of the following set of data: [10, 2, 6, 7, 18, 0, -3, 5] Which of the following statements are not true? 3 is the root node and 10 and and 18 are among the leave nodes. O 18 is the root node and 2 and and -3 are among the leave nodes. 18 is the root node and 7 and and -3 are among the leave nodes. O 18 is the root node and 7 and and 10 are among the leave nodes.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

a) Create a min-heap tree for the following numbers. The numbers are read in sequence from left to right. 14, 7, 12, 18, 9, 25, 14, 6 b) How would the above heap tree be changed when we remove the minimum?
Data Structure
This is C++ Programming
1. Create Max Heap from the following numbers: 5,1,2,7,3,8,4,10,9,6 2. B D A E S F G a) Create Adjacency Matrix of the graph. b) Find the Strongly Connected Components.
Design a struct personalinfo with components id, and name of type string. Design a class student with private data member's person (struct variable of type personalInfo), number Of Courses (of type integer), average (of type float), and marks[] an array of student's marks of type integer. The class also has the member functions ser( ), getPerson(), print(), findAverage(), getAverage(), and a parameterized constructor with default value 1 for the number of courses. Implement the member functions of the class student. The member function findAverage() is used to calculate the average mark for each student. I Write a driver that does the following: Declares the array section[ ] of objects of student type. Reads the number of students. Reads information for each student from the file student.txt. Calls the user-defined function int maxAverageIndex(int, student []) Prints the id and name of the student with the maximum average. Student.txt: 4 1463491 Ali 72 65 81 85 1370005 Yousef 5 91 82…
a. What is the key value of the left child of 88? b.What is the key value of the right child of 88? c. Start with the original max-Heap. What is the key of the left child of the root (element 0 of the vector) after a pop() operation?
Computer Science correct answers required AND THE ANSWER SHOULD BE ONLY IN C PROGRAMMING LANGUAGE a) Write a program that takes the details of student's name, age and city and put them in a priority queue based on age. Ensure that while entering the details the record must be inserted into its proper position based on the age. Assume that higher the age higher the priority. Implement the same using heap. Display the input records and contents of priority queue.
Copy A-D to your Solution file and remember to answer all questions A. Write your name. B. Write code oriented pseudo-code or a C++ function that given a binary tree of heaps, deletes an element form each heap and places it into a dynamically allocated array based on the right-left-root order of the binary tree. Assume the following: · Each node in the binary tree has a pointer to a heap object. · Each heap contains at least one element, a pointer to a Data object. The last element in the array is to be a sentinel value that will be set to NULL. • To complete this task call heap ADT functions. C. Give an example that could be used to test this algorithm. Show what is given and what is returned. D. List any assumptions used in your design.
Please answer as much as you can even a little work will be appreciated and I will give thumbs up. Just do as much as you can :)
07: Consider the following binary tree; Write a C code/algorithm which describe the procedure of post- order traversal along with the resultant string dispiayed after post-order traversal. The following tree has a large number of null references, discuss any technique to reduce this memory wastage to its maximum.
In Part c take 04 and 09 as last 2 digit
A min-heap is useful when we are interested in the minimum value of aset of numbers. Now, instead of the min, we are interested in the K-th smallest value. a.) ) Please design a data structure to allow the following two operations: push (insert a newnumber) and find_Kmin (return the value of the K-th smallest number without removing it). Bothoperations should be done in O(log K) time. b.) In addition to push and find_Kmin, now we also want to support the pop operation toreturn and remove the K-th smallest element. Please design a data structure to support these threeoperations, and each operation should take O(log n) time with n being the size of the current set.