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

Java programming

Computer science

My DOB is 15

my MOB is 7 

Please please help me

Im desperate for your help please?

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

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?
Transcribed Image Text: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
Transcribed Image Text: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
Expert Solution
steps

Step by step

Solved in 6 steps with 4 images

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