Qus $1($a$)$: Draw a Binary Search Tree using the following data:

$\left[\begin{array}{cccccccccc}26& 05& 77& 01& 61& 11& 59& 15& 48& 19\end{array}\right]$

$1(6)$: Using the BST$,$ write the data in ascending order. Is the BST balanced?

$1($c$)$: Draw the AVL Tree using the following data:

$\left[\begin{array}{cccccccccc}26& 05& 77& 01& 61& 11& 59& 15& 48& 19\end{array}\right]$

Start from the first data and make suitable rotations as and when required.

$(20$ Marks$)(4-5$ Pages$)$