"Construct a circular XE$10$ queue of size $7$ containing $4$ elements $(10,4,12,20).$

Draw the structure of the queue after performing the following operations.

a$.$ Enqueue $(34)$; Enqueue $(14)$;

b$.$ Dequeue $()$; Dequeue $()$; Enqueue $(17)$

c$.$ Enqueue $(56)$; Dequeue $()$; Enqueue$(45)$

d$.$ A tree with a depth of $3$ and indicate all the nodes as either a parent, child, root, or leaf node$($s$).$

$2.$Construct a binary search tree $($BST$)$ with the following list $29,37,12,20,19,45,36,40,61,60,6,1.$ Read the list from left to right.

a$.$ Delete nodes $12$ and $45$ and reconstruct the tree.

b$.$ Delete nodes $20$ and $37$ and reconstruct the tree."