Find a textbook or other reference that discusses Binary Sea

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 binary tree Write the expression ia #3 in PREFIX and POSTFIX notation Convert the expression AB+CD-E*FGH*rightarrow * (in postfix form) into its fully parenthesized form.

Solution

As of now i am able to answer only 4 and 5 part

4) A+B*(C-D)+E*F
Prefix notation :
++A*B-CD*EF

Postfix Notation
ABCD-*+EF*+

5) AB+ CD-E*FGH*-+*
((A+B)+E*(C-D))*(G*H))