Prove that a binary tree that is not full cannot correspond to an optimal prefix code....

Prove that a binary tree that is not full cannot correspond to an optimal prefix code. The proof should first consider a prefix-free code C, whose corresponding binary tree T has some node with only one child; show that one can transform T into another binary tree T', whose corresponding code C' has smaller average length and so is better than C. In your proof you need to indicate the transformation from T into T' and explain why the code C' is better than C.

Expert Solution

Here goes the proof:

Otherwise, let M be the parent of N, let T1 be the (possibly non-existent) sibling of N, and let T2 be the subtree rooted at the child of N. Replace M by N, making the children of N the roots of subtrees T1 and T2. If T1 is empty, repeat the process. We have a new prefix code (C') of lower cost, so the original was not optimal.

venereology answered 1 year ago

(IN C) Write the code to manage a Binary Tree. Each node in the binary tree...

(IN C) Write the code to manage a Binary Tree. Each node in the binary tree includes an integer value and string. The binary tree is sorted by the integer value. The functions include: • Insert into the binary tree. This function will take in as parameters: the root of the tree, the integer value, and the string. Note that this function requires you to create the node. • Find a node by integer value: This function takes in two...

Name three similarities or differences between a balanced tree, complete tree and full binary tree.

Write the code to manage a Binary Tree. Each node in the binary tree includes an integer value and string.

Programming CWrite the code to manage a Binary Tree. Each node in the binary tree includes an integer value and string. The binary tree is sorted by the integer value. The functions include:• Insert into the binary tree. This function will take in as parameters: the root of the tree, the integer value, and the string. Note that this function requires you to create the node.• Find a node by integer value: This function takes in two parameters: the root...

1. Modify a binary search tree implementation code (that AVL tree code depends on) to print...

1. Modify a binary search tree implementation code (that AVL tree code depends on) to print out the data value for each node it encounters in the insert operation. Remember that the module AVL tree code gets part of its functionality from the BST type, since an AVL tree is a binary search tree, but adds some additional functionality. 2. Add code to the main method to meet the following requirements: (a) Create an AVL tree to hold names stored...

Define a tree. Distinguish between a tree and a binary tree. Distinguish between a binary tree and a binary search tree.

Write a simple Java code to make a Binary Tree for the following tree: Don’t use...

Write a simple Java code to make a Binary Tree for the following tree: Don’t use serializable interface implantation /** Class to encapsulate a tree node. */ protected static class Node implements Serializable {

Java code for a binary tree that does the following:  Display a menu to the...

Java code for a binary tree that does the following:  Display a menu to the user and request for the desired option.  Based on the user’s input, request for additional information as follows: o If the user wants to add a node, request for the name (or ID) of the new node to be added as well as the name of the desired parent of that node.  If the parent node already has two children, the new...

Java code for a binary tree that does the following:  Display a menu to the...

Java code for a binary tree that does the following:  Display a menu to the user and request for the desired option.  Based on the user’s input, request for additional information as follows: o If the user wants to add a node, request for the name (or ID) of the new node to be added as well as the name of the desired parent of that node.  If the parent node already has two children, the new...

a tree is binary, if every node has at most two children nodes. prove that the...

a tree is binary, if every node has at most two children nodes. prove that the maximum of nodes in a binary tree of height h is 2^(h+1)-1

CODE IN JAVA** I(a). Given a pointer to the root of a binary tree write a...

CODE IN JAVA** I(a). Given a pointer to the root of a binary tree write a routine that will mark (use a negative number like -999 for the info field) every node in the tree that currently has only a left son. You can assume the root of the tree has both a right and left son. When finished tell me how many nodes had only a left son as well as how many nodes are in the tree in...

Question

Prove that a binary tree that is not full cannot correspond to an optimal prefix code....

Solutions

Expert Solution

Related Solutions

(IN C) Write the code to manage a Binary Tree. Each node in the binary tree...

Name three similarities or differences between a balanced tree, complete tree and full binary tree.

Write the code to manage a Binary Tree. Each node in the binary tree includes an integer value and string.

1. Modify a binary search tree implementation code (that AVL tree code depends on) to print...

Define a tree. Distinguish between a tree and a binary tree. Distinguish between a binary tree and a binary search tree.

Write a simple Java code to make a Binary Tree for the following tree: Don’t use...

Java code for a binary tree that does the following:  Display a menu to the...

Java code for a binary tree that does the following:  Display a menu to the...

a tree is binary, if every node has at most two children nodes. prove that the...

CODE IN JAVA** I(a). Given a pointer to the root of a binary tree write a...