Create a binary search tree with the given elements. $271735205297519$ and $22.$ Consider the algorithm given below. What is the operation that is being performed? Step $1$: node $*$ptr$=$root. Step $2$: node $*$ptr$1=$root Step $3$: if ptr$->$left $!=$ NULL, go to step $4$ else go to Step $6$ Step $4$: ptr$1=$ptr Step $5.$ ptr$-$ptr$-$left, go to step. $3$ Step $6$: ptr$->$left $=$NULL Deletes the left child of root node Delete inorder predecssor of $17.$ Finds the left most node Finds the preorder successor of root node