urgent solution required!! Data Structures and Algorithms:

Q1. Answer the following questions in maximum two lines. i) Why there are three traversals of BST? ii) What is the purpose of adding dummy head node in TBST? iii) What are the two rules of moving operators from stack to postfix during infix to postfix conversion? iv)What does frequency of characters show in the data available for the creation of Huffman tree? v) After making the BT from Inorder and Postorder traversals, how can we verify that we have made it correctly?