Question $1$

Given the following Binary Search Tree, please answer the subsequent questions.

Ignore the edge between $e$ and $h.$

Which node has the maximum value? f$.$

Which node has the minimum value? g$.$

Which node is the successor of node i $?$ l$.$

Which node is the predecessor of node d $?$ j$.$

Which node is the predecessor of node f$?$ c$.$

$-6)$ Which node is the successor of node o$?$ b

How to delete node k$?$ explain. The successor of $k$ is s$.$ Just promote s to position of $k.$

How to insert a node that with a value greater than the value of node f $?$ explain. Insert as the

right child of $f.$