What are the operations performed in list?

Define Tree. Explain the tree traversals with algorithms and

examples.

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.

Explain binary search tree ADT in detail.

Explain AVL tree ADT in detail.

Explain b tree and B+ tree ADT in detail.

Explain Heap tree ADT in detail.

Explain threaded binary tree ADT in detail.