1. Define non-linear data structure. Define tree and leaf

2 Define Tree. Explain the tree traversals with algorithms and examples.

3 What is a ordered tree? What is meant by directed tree? List out the steps involved in deleting a node from a binary search tree.

4 Explain binary search tree in detail.

5 Construct an expression tree for the expression (a + b * c) +((d * e + 1) * g). Give the outputs when you apply preorder,inorder and postorder traversals.