a) Apply the Huffman encoding to encode the following string over alphabet = {e.h, i, o,p..}. When selecting two trees with minimum frequencies, break ties by selecting the tree whose leftmost leaf appears earlier in the above ordering of characters in the alphabet. Also, assume the tree with a smaller frequency forms the left child of the merged tree (and in case of equal frequencies, the subtree whose left-most leaf appears earlier in the alphabet forms the left child). hippie hipo Your solution must include the (final) Huffman tree and its code for the input se- quence. b) Use the same Huffman encoding to decode the following code: 0001110001111101110

Write code for this question in C++ language only with proper comments and explaination.

13 46 65 58 84 94 98 Node 84 is to be removed from the above BST Tree. The first step is to find the rightmost node of 84. How will you find it? and What is the rightmost node of 84?

Consider the AVL Tree below. Use the AVL Tree Insertion algorithm to add 0060 to the tree. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 50 33 80 77 85 0050 2 0033 0080 0077 0085 3.

The following description to Binary Search Tree(BST), which is not correct? multiple choice a. The key value of each node in BST is unique ☐ b. The value of root node is the Minimal in whole tree c. The keys (if any) in the left subtree are larger than the key in the root d. The keys (if any) in the right subtree are smaller than the key in the root ☐e. BST is a binary tree f. The keys (if any) in the children subtree are smaller than the key in the root g. BST is a complete binary tree ☐ h. The keys (if any) in the left subtree are smaller than the key in the root i. The value of root node is the Maximal in whole tree j. BST is a Tree k. The keys (if any) in the right subtree are larger than the key in the root 1. The keys (if any) in the left subtree are no larger than the key in the root □ m. The keys (if any) in the right subtree are no smaller than the key in the root n. The value of root node is the average value for whole tree o. Empty is a BST Op. BST may be formed as a Skewed…

I really need help with this below, please. I need to draw four AVL tree, balancing as I add items Every time I need to rebalance the tree, I must label it to show• which of the 4 cases it is (right/right, right/left, left/right, or left/left),• which rotations (left or right) are performed.  If a single rebalancing operation requires two rotations, you may either show the end result after bothrotations, or show both rotations separately. Every time thr tree is rebalanced, you should draw the resulting tree in black, and draw the newly-addednodes (up to the next rebalancing) in a different color. Exercise  – random orderAdd the numbers below to a balanced BST in the order given. 36 21 70 20 14 88 96 7481 19 83 68 93 16 64 99

In which order would you need to insert the values 68, 99, 24, 47, 30, 74, 97 into an initially empty binary search tree in order to get a full binary search tree? A 'full binary search tree' is a tree in which every node other than the leaves has two children. Draw the resulting tree. IMPORTANT: The penalty scheme for this question is 0, 50, 100%. Answer: (penalty regime: 0, 50, 100 %) Help Clear Check

For my Insert and Remove Method for a BInaryTree how can I replicate it for the AVL Insert and Remove I have below... I need to have the AVL Insert and Remove work for strings properly like it does for my Binary Tree... but when I use the Methods I believe I get an error pertaining to how BinNode and Strings work for it...   public class BinNode{private String data;private BinNode left;private BinNode right;private int height;private boolean color; private BinNode parent;public BinNode(){data = "";left = null;right = null;parent = null;color = false; }public boolean getColor() {return color;}public void setColor(boolean color) {this.color = color;}public BinNode getParent() {return parent;}public void setParent(BinNode parent) {this.parent = parent;}public int getHeight() {return height;}public void setHeight(int height) {this.height = height;}public BinNode(String d){data = d;left = null;right = null;}public void setData(String d){this.data = d;}public String getData(){return…

1. Consider the following formula (i) q P q T 9 T (ii) p (a) Identify the string representation (e.g. pVqq) of each of the formulas above. (b) Create the tree representation of the formula corresponding to (q^(p→q)) V (r + p). (c) Note that, if you just delete all of the parentheses in the string formulas from (a) and (b), all three would turn into q^pqVrp. Do either of the two formulas in (a) or the formula in (b) correspond to qpqVrp? Explain your answer.

Given the following tree, calculate the postorder traversal order of its e lements. F A В D E