Q1. prepare down an algorithm to assess a postfix expression by using the stack.
Q2. Supposing a pointer P is given to the node P that is not a head node or tail node in a singly linked list. prepare down the pseudo code to delete this node from the list.
Q3. Make a Heap if the values 100, 200, -10, -30, -60, 80, 90, 300 are inserted.
Q4. prepare down the algorithm for the BFS traversal of a graph.
Q5. Sort the given numbers by using the Radix sort:
100, 300, 95, 60, 10, 900, 800 showing the positions of different buckets.
Q6. Illustrate the given terms:
a) General tree
b) Forest
c) Graph
e) Game Tree
Q7. Illustrate the difference between the binary trees and B-trees.