Answer to Question #227797 in Algorithms for umme habiba sumi

Question

Consider the following infix expression 

Q: ((A+C)*D)ꜛ(B+F/E)+G use POLISH Algorithm to translate Q into its equivalent postfix expression P.

Let A, B, C, D, E, F, G, H be eight data items with the following assigned weights:

Data item: A B C D E F G H

Weight: 20 7 11 17 5 10 24 6

Construct Binary tree using Huffman Algorithm also find the path length of the tree.

Answer 1

Dear umme habiba sumi, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order