Given a set of 10 letters , D, S, A, E, T, C, G, M, W }, answer the following: a) With the given letters above, we can construct a binary search tree (based on alphabetical ordering) and the sequence < C, D, A, G, M, I, W, T, S, E > is obtained by post-order traversing this tree. Construct and draw such a tree. NO steps of construction are required. b) The letter S is first removed from the binary search tree determined above, followed by inserting a new letter R. Draw the updated binary search tree after removal and insertion. Choose the logical predecessor (not the successor) of the removing node if necessary. c) Determine and list the sequence of elements obtained by pre-order traversing the updated binary search tree after removal and insertion above. No steps are required. d) Suppose we are given the first six elements < I, D, S, A, E, T > and their frequencies of occurrence < 5, 6, 2, 4, 5, 2 >, construct and draw the Huffman Tree based on these elements above and their frequencies of occurrence as their weights. Clearly indicate the keys, the bit value in each edge, and the weight of each node in the tree as in our course material. NO steps of construction are required.

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
Question 6
Given a set of 10 letters J, D, S, A, E, T, C, G, M, W }, answer the following:
a) With the given letters above, we can construct a binary search tree (based on alphabetical
ordering) and the sequence < C, D, A, G, M, I, W, T, S, E > is obtained by post-order
traversing this tree. Construct and draw such a tree. NO steps of construction are required.
b) The letter S is first removed from the binary search tree determined above, followed by
inserting a new letter R. Draw the updated binary search tree after removal and insertion.
Choose the logical predecessor (not the successor) of the removing node if necessary.
c) Determine and list the sequence of elements obtained by pre-order traversing the updated
binary search tree after removal and insertion above. No steps are required.
d) Suppose we are given the first six elements < I, D, S, A, E, T > and their frequencies
of occurrence < 5, 6, 2, 4, 5, 2 >, construct and draw the Huffman Tree based on these
elements above and their frequencies of occurrence as their weights. Clearly indicate the
keys, the bit value in each edge, and the weight of each node in the tree as in our course
material. NO steps of construction are required.
Transcribed Image Text:Question 6 Given a set of 10 letters J, D, S, A, E, T, C, G, M, W }, answer the following: a) With the given letters above, we can construct a binary search tree (based on alphabetical ordering) and the sequence < C, D, A, G, M, I, W, T, S, E > is obtained by post-order traversing this tree. Construct and draw such a tree. NO steps of construction are required. b) The letter S is first removed from the binary search tree determined above, followed by inserting a new letter R. Draw the updated binary search tree after removal and insertion. Choose the logical predecessor (not the successor) of the removing node if necessary. c) Determine and list the sequence of elements obtained by pre-order traversing the updated binary search tree after removal and insertion above. No steps are required. d) Suppose we are given the first six elements < I, D, S, A, E, T > and their frequencies of occurrence < 5, 6, 2, 4, 5, 2 >, construct and draw the Huffman Tree based on these elements above and their frequencies of occurrence as their weights. Clearly indicate the keys, the bit value in each edge, and the weight of each node in the tree as in our course material. NO steps of construction are required.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 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