The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)i) from root search for the node to be deletedii)iii) delete the node atwhat must be statement ii) and fill up statement iii)

• A. ii)-find random node,replace with node to be deleted. iii)- delete the node
• B. ii)-find node to be deleted. iii)- delete the node at found location
• C. ii)-find deepest node,replace with node to be deleted. iii)- delete a node
• D. ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node