Q$1)$

$1)$ Draw binary search tree from following keys $($entered from left to right$)$:

$50,20,10,55,100,15,65,40,85,75,70,25,5$

$2)$ insert $30$ in final tree in part $1.$

$3)$ Remove $50$ from final tree in part $2$

$4)$ What is In$-$order traversal of final tree in part $3$

$5)$ What is Pre$-$order traversal of final tree in part $3$

$6)$ What is Post$-$order traversal of final tree in part $3$

$7)$ What are Hight$(100)$ and Depth $(100)$ from final tree in part $3?$

Q$2)$

$1)$ Draw binary tree for arithmetic expression: $(2$ x $3)+(5+4)$ x $(61)$

$2)$ Which of the below tree is a binary search tree?

BST$-1.$png$-$ picture attached

$3)$ In part $2-$I, which nodes will be visited when you insert L$?$

$4)$ In part $2-$II$,$ which nodes will be visited when you insert S$?$

$5)$ In part $2-$I, If node K is to be removed, which node$($s$)$ should be copied into its location?

$6)$ In part $2-$II$,$ If node D is to be removed, which node$($s$)$ should be copied into its location?

Q$3)$

Draw all binary search trees containing A$,$ B$,$ and C data values.