In computer science, a binary tree is a data structure in which each node has at most two children, which are referred to as the left child and the right child.

(a) Use a binary tree of your choice to illustrate the following traversal methods:

i. Preorder traversal.

ii. In order traversal.

iii. Post order traversal.

(b) An expression tree is a binary tree with the following properties:

Each leaf is operand.

The root and internal nodes are operators.

Subtrees are subexpressions, with the root being an operator.

Create the expression tree for the following expression and then write its equivalent postfix expression and prefix expression.

(a + b * c d) / (e + f * g)

(c) Create a BST for the following sequence of numbers and then write the result of preorder, inorder and postorder traversal of the tree.

5, 13, 7, 3, 9, 11, 8, 1, 14, 15, 10, 4