Given, a circular singly linked list with values of nodes in the order: $33,45,$

$50,68,90.$ Draw the list and show the changes in your diagrams if a node with

value $24$ is "Inserted at first" and also if a "delete last node" operation is carried

out. $[5]$

What are cases to consider for deleting a node of a BST$?$ In the given BST$,$

show the steps to delete node $(42)$ and construct the tree after deleting it$.[5]$

Draw the $($i$)$ adjacency matrix and $($ii$)$ adjacency list to represent the given

directed graph. $[5]$

Now omit the direct edge from vertex a to vertex e$.$ Show the state of the

stack if we run a BFS from source vertex a and destination vertex e$.[5]$

Build a Min$-$Heap with the following numbers inserted in order. Show the

array and tree representation. $[5]$