Q2: What is the value of top? What value in the array is on the top?

Q4: What is the value of Head, what value is at the head of the queue? what is the value of Tail? what value is at the tail of the queue?

Q5 What is the value of Head, what value is at the tail of the queue? What technique it is called by allowing tail less than head?

Q7: What is the value of top? what value in the list is on the top?

Q9: What is the value of Head, what is the value of Tail?

Q8: What is the initial value of head and tail?

Stack (Array Implementation) Push Pop Clear Stack top 17 35 27124572 9 10 121314 15 1 7 8920212223 24 25 2 2728 2 Queue (Array Implementation) Enqueue Dequeue Clear Queue Head 3Tai1 7 31 54244857 21 012345 71011 1213 Queue (Array Implementation) Enqueue Dequeue Clear Queue Head 5Tai 32 54 11 244857 2138 42 579 0 23456 78 1012 3 14 Stack (Linked List Implementation) Push Pop Clear Stack Top 21 57 24 29 35 17 Queue (Linked List Implementaion) Enqueue Dequeue Clear Queue Head 48 57 24 31 54 Tail Queue (Linked List Implementaion) Enqueue Dequeue Clear Queue Head Tail