Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
NOTE: In all what follows, DOB refers to your day of birth and MOB would be the month of your birth. If you are born on 9/28/1990. DOB = 28 and MOB = 9 Problem 1 Draw the following binary tree. Where only the key is shown (disregard 2xDOB or 3xMOB if it is same as one of the numbers): 35, 20, 23, 15, 40, 38, 2xDOB, 45, 33, 48, 3xMOB, 13, 46, 17, 39, 16, 21 1- Is the tree balanced? 2-Show the inOder, pre-Order and post-Order traversal of the tree. 3-delete node 20 using the largest on the left. If you are given a reference to node 20, what would be the java code to perform the deletion? 4- delete 2xDOB using the smallest on the right. If you are given a reference to node 2xDOB, what would be the java code to perform the deletion?

NOTE: In all what follows, DOB refers to your day of birth and MOB would be the month of your birth. If you are born on 9/28/1990. DOB = 28 and MOB = 9 Problem 1 Draw the following binary tree. Where only the key is shown (disregard 2xDOB or 3xMOB if it is same as one of the numbers): 35, 20, 23, 15, 40, 38, 2xDOB, 45, 33, 48, 3xMOB, 13, 46, 17, 39, 16, 21 1- Is the tree balanced? 2-Show the inOder, pre-Order and post-Order traversal of the tree. 3-delete node 20 using the largest on the left. If you are given a reference to node 20, what would be the java code to perform the deletion? 4- delete 2xDOB using the smallest on the right. If you are given a reference to node 2xDOB, what would be the java code to perform the deletion?

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

Java programming

Computer science

I need help with problem 1

My DOB is 15

my MOB is 7 

Please please help me

I'm desperate for your help, please?

I really need this, please. I don't understand it that much

### Educational Website Content --- ### Binary Trees and Heaps: Problems and Exercises **Note:** In all what follows, DOB refers to your day of birth and MOB would be the month of your birth. For example, if you are born on 9/28/1990, then DOB = 28 and MOB = 9. #### Problem 1 Draw the following binary tree. Only keys are shown in the list below; disregard 2xDOB or 3xMOB if it is the same as one of the numbers: 35, 20, 23, 15, 40, 38, 2xDOB, 45, 33, 48, 3xMOB, 13, 46, 17, 39, 16, 21 1. **Is the tree balanced?** 2. Show the **in-order**, **pre-order**, and **post-order** traversal of the tree. 3. **Delete node 20** using the largest on the left. If you are given a reference to node 20, what would be the Java code to perform the deletion? 4. **Delete 2xDOB** using the smallest on the right. If you are given a reference to node 2xDOB, what would be the Java code to perform the deletion? #### Problem 2 Assume that you are implementing a heap using a **fixed size array**. 1. Illustrate how the following heap would be constructed (show the content of the array, show in detail only what happens when nodes DOB and 17 are added). The nodes are inserted in the following order (key, value): - (9, -4) - (3, -6) - (11, -4) - (13, -7) - (DOB, -2) - (12, -8) - (3xMOB, -5) - (17, -7) - (6, -3) 2. Illustrate what happens to the heap when invoking remove (show the details). 3. Assume that you have an array of integers, write code that would allow you to sort the array in ascending order (smallest to largest), using only a heap. #### Problem 3 Consider that you have a graph with 8 vertices numbered A to H, and the following edges: (A, B),
Transcribed Image Text:### Educational Website Content --- ### Binary Trees and Heaps: Problems and Exercises **Note:** In all what follows, DOB refers to your day of birth and MOB would be the month of your birth. For example, if you are born on 9/28/1990, then DOB = 28 and MOB = 9. #### Problem 1 Draw the following binary tree. Only keys are shown in the list below; disregard 2xDOB or 3xMOB if it is the same as one of the numbers: 35, 20, 23, 15, 40, 38, 2xDOB, 45, 33, 48, 3xMOB, 13, 46, 17, 39, 16, 21 1. **Is the tree balanced?** 2. Show the **in-order**, **pre-order**, and **post-order** traversal of the tree. 3. **Delete node 20** using the largest on the left. If you are given a reference to node 20, what would be the Java code to perform the deletion? 4. **Delete 2xDOB** using the smallest on the right. If you are given a reference to node 2xDOB, what would be the Java code to perform the deletion? #### Problem 2 Assume that you are implementing a heap using a **fixed size array**. 1. Illustrate how the following heap would be constructed (show the content of the array, show in detail only what happens when nodes DOB and 17 are added). The nodes are inserted in the following order (key, value): - (9, -4) - (3, -6) - (11, -4) - (13, -7) - (DOB, -2) - (12, -8) - (3xMOB, -5) - (17, -7) - (6, -3) 2. Illustrate what happens to the heap when invoking remove (show the details). 3. Assume that you have an array of integers, write code that would allow you to sort the array in ascending order (smallest to largest), using only a heap. #### Problem 3 Consider that you have a graph with 8 vertices numbered A to H, and the following edges: (A, B),
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of trees
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.
Similar questions
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