Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Insert key 63 into the following Max-heap, then delete key 70. Use your final result to answer the following questions: 70 60 50 40 30 20 10 Max heap (a) What is the index of the node containing key 60 in the resulting tree? (b) List the leaves from left-to-right in the resulting tree? Note: The root is considered to have index 0.

Insert key 63 into the following Max-heap, then delete key 70. Use your final result to answer the following questions: 70 60 50 40 30 20 10 Max heap (a) What is the index of the node containing key 60 in the resulting tree? (b) List the leaves from left-to-right in the resulting tree? Note: The root is considered to have index 0.

Database System Concepts
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
icon
Related questions
Question

i want the answer for 2 qustion 

Insert key 63 into the following Max-heap, then delete key 70. Use your final result to answer the following questions: 70 60 50 40 30 20 10 Max heap (a) What is the index of the node containing key 60 in the resulting tree? (b) List the leaves from left-to-right in the resulting tree? Note: The root is considered to have index 0.
Transcribed Image Text:Insert key 63 into the following Max-heap, then delete key 70. Use your final result to answer the following questions: 70 60 50 40 30 20 10 Max heap (a) What is the index of the node containing key 60 in the resulting tree? (b) List the leaves from left-to-right in the resulting tree? Note: The root is considered to have index 0.
Using the given BST, list the elements of the resulting tree in breadth-first order after applying each of the following operations. (a) insert keys 35 and 23 (b) delete key 20 using delete-by-copying method and using the predecessor of this key (c) delete key 36 using delete-by-mergeing method and by merging to the left subtree. Note: apply operation (b) on the tree resulting of (a), and apply operation (c) on the tree resulting of (b) 25 20 36 10 22 30 40 12 28 38 48 5
Transcribed Image Text:Using the given BST, list the elements of the resulting tree in breadth-first order after applying each of the following operations. (a) insert keys 35 and 23 (b) delete key 20 using delete-by-copying method and using the predecessor of this key (c) delete key 36 using delete-by-mergeing method and by merging to the left subtree. Note: apply operation (b) on the tree resulting of (a), and apply operation (c) on the tree resulting of (b) 25 20 36 10 22 30 40 12 28 38 48 5
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS