Discrete Mathematics

Name $q,$

Math $315$

Extra #$2$ Learning Project: $1$:$00$ p$.$m$.,$ Wednesday, October $30,2024$

Find a textbook or other reference that discusses "Binary Search Trees" and "Algebraic Expression Evaluation using Binary Trees." Then do the following problems:

Put the words: APPLE, BROWN, CHEESE, DOUGHNUT, ELEVATOR, FREE, GRAPE, and HAIR into a binary search tree with height no more than $3.$

Perform a PREORDER, POSTORDER and INORDER search on your tree from #$1$

Write the algebraic expression $A+B^{**}(C-D)+E**F$ as a binary tree

Write the expression in #$3$ in PREFIX and POSTFIX notation.

Convert the expression $AB+CD-E^{**}FG{H}^{**}++{?}^{**}($in postfix form$)$ into its fully parenthesized form.