$|$Assignment $11$ on Chapter $24$

Consider a binary tree that has three levels.

a$.$ What is the maximum number of nodes in this tree?

b$.$ What is the maximum number of leaves in this tree?

Consider a traversal of a binary tree. Suppose that visiting a node means to

simply display the data in the node. What are the results of each of the

following traversals of the trees in the Figure below?

a$.$ Preorder b$.$ Postorder c$.$ Inorder d$.$ Level order

$($a$)$

Draw a parse tree for each of the following algebraic expressions:

a$.$ a$+$b$^(*)$c

b$.($a$+$b$)*($c$-$d$)$

What to submit:

The word documents that includes the solutions.