Q$1)$ Write the Representation of Tree Node by using: $1.$ A node is represented by an object storing $2.$ Left Child, Right Sibling Representation C M R S A B T D P Q U $1/2$ Name: ID: Q$2)$ Assume you have the following binary $($expression$)$ tree and write down the resultant expression Perform this expression by using: $1)$ Preorder traversal $2)$ Postorder traversal $3)$ Inorder travers