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
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
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.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8ae7e7a8-773c-4391-b33e-fe525d2f63f2%2F4535c980-5c4b-4d1f-818d-ed99f0373226%2Fo9zvf85_processed.png&w=3840&q=75)
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8ae7e7a8-773c-4391-b33e-fe525d2f63f2%2F4535c980-5c4b-4d1f-818d-ed99f0373226%2Fv36apaa_processed.jpeg&w=3840&q=75)
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
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education