a) How we can decrement front/rear for wrap around implementation of queue using array.

b) Which implementation (Array or Link list based) of Binary Tree is efficient in case of almost complete nomary tree and why?

c) Which implementation (Array or Link list based) of Binary Search Tree is efficient in case of you don't know about nature of tree values and tree structure and why?

d) Draw expression tree for the following expression. (9-(2+3)*5) * (3+8/2) 2/3