1. Give some example of the application of Tree-data structure?

   Ans. Application of Tree- data structure:

   • The manipulation of Arithmetic expression,
   • Syntax analysis

2. How many minimum numbers of queues are needed to implement the priority queue?

   Ans. Two queues are needed. One queue is used for actual storing of data and another for storing priorities.