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.

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

See similar textbooks

Similar questions

TREE A: 6. 1 4 7 9 1. Is tree A a binary search tree? 2. If tree A is a binary search tree, is it balanced or skewed? If it is not a binary search tree, why not?
Create a function that checks whether a binary tree is balanced. For the sake of this issue, a balanced tree is one in which the heights of the two subtrees of each node never deviate by more than one.
Given a binary search tree and data of two nodes, find 'LCA' (Lowest Common Ancestor) of the given two nodes in the BST.LCALCA of two nodes A and B is the lowest or deepest node which has both A and B as its descendants. Example:In this example, the green coloured node is the LCA to A and B.Alt TextNote:It is defined that each node is a descendant to itself, so, if there are two nodes X and Y and X has a direct connection from Y, then Y is the lowest common ancestor.Example:Alt TextNote:1. If out of 2 nodes only one node is present, return that node. 2. If both are not present, return -1.3. all the node data will be unique.Input format:The first line of input contains data of the nodes of the tree in level order form. The data of the nodes of the tree is separated by space. If any node does not have left or right child, take -1 in its place. Since -1 is used as an indication whether the left or right nodes exist, therefore, it will not be a part of the data of any node.The following…
The “successor”of an existing key in a Binary Search Tree (BST), i.e. from that keywrite the algorithm that finds the next key in the form of Python code. ”successor"you can accept that the key exists in BST. Note:”sucessor " is where the searched key sitsjust as a node can be a right-subtree, this node may not be a network-subtree, but thisstatus does not mean that the key will not have a “successor”.
Consider the following binary search tree (BST): List down the sequence of elements encountered when the BST is traversed using pre-order and in-order.
Please written by computer source
Using a tree T with a root node s, quickly determine whether node u is a descendant or ancestor of node v by writing a function that accepts u and v as input.
A Binary Search Tree (BST) can be used to efficiently implement a sorted set. It stores uniquevalues and offers an efficient membership method (contains).A binary search tree (BST) is a binary tree with the additional binary search tree property.The binary search tree property states that for every node n in the tree1. n.data is greater than the data value of all nodes in the sub-tree rooted with n.left.2. n.data is less than the data value of all nodes in the sub-tree rooted with n.right.As we are implementing a set, all data (strings) in the tree will be unique. Every node in the treewill have its own distinct string. Strings will be compared using the canonical way (as defined bythe compareTo() method in the String class).For example, the binary tree on the left (below) IS a binary search tree and the one on the rightis NOT.You will implement several methods in the BinaryTree and BST classes. The BST class mustextend the BinaryTree class. Methods that you must complete (implement or…
Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one
Form a binary search tree w/o repeats from the following sentence: Fear of a name increases fear of the thing itself. What would be the inorder traversal of this tree? (write your answer with a comma between words and NO spaces.)
Give an algorithm for a function int largest(TreeNode *tree) that takes a pointer to a root of a binary search tree as parameter and returns the largest value stored in the tree.