Draw binary expression trees for the following infix expressions

SELF-CHECK

Draw binary expression trees for the following infix expressions. Your trees should enforce the Java rules for operator evaluation (higher-precedence operators before lower-precedence operators and left associativity).

x / y + a – b * c

(x * a) – y / b * (c + d)

(x + (a * (b – c))/d

Using the Huffman tree in Figure 6.5,

Write the binary string for the message “scissors cuts paper”.

Decode the following binary string using the tree in Figure 6.5:

1100010001010001001011101100011111110001101010111101101001

For each tree shown below, answer these questions. What is its height? Is it a full tree? Is it a complete tree? Is it a binary search tree? If not, make it a binary search tree.

40
40
30
55
30
55
32)
32
35
50