Explain the concept of tree traversal in data structures. What is the purpose of traversing a tree? Describe three common methods for tree traversal: Inorder Preorder, and Postorder. For each method, explain the order in which nodes ar visited and provide a real$-$world analogy that helps understand the traversal sequence. Apply the following operations on the binary search tree given below. Write all the basic steps needed.

a$.$ Inorder Traversal

c$.$ Postorder Traversal