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 deleted ii) iii) delete the node at what must be statement ii) and fill up statement iii)

Correct Answer: ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node
We just replace a to be deleted node with last leaf node of a tree. this must not be done in case of BST or heaps.