delete this node 15 10 12 right subtree 10 18 19 17 17 smallest node in the right subtree Successor 20 20 15 25 15 deleteNode 25 10 18 10 16 16 17 Case 2: Node to be deleted has only one child. 17 Consider the above diagrams and write a complete Deletion code of BST that display the same result /output in above diagram. Before Deletion: Inorder: 10 15 16 17 18 19 20 25 Node Deleted After Deletion: Inorder: 10 16 17 18 19 20 25