Code the questions (3, 4, 5) given in the exercises of slides "Data Structures

Use programming language

C#

1. Construct expression tree whose PostOrder Traversal is: 2^2a*b*-b2^+ab-/ R S T 2. Give Preorder, InOrder, and Postorder of the following expression tree U X V Y z 3. Write a program to construct an expression tree, give a character string specifying its preorder traversal. 4. Write a function takes root and key, then search for the key in BST. 5. Write a function to construct a BST