I was first asked to explain my process verbally. Then write a code for it, but not run the code in a compiler, but dry run it. You first find the target node using binary search. Then proceed based on the no. of children of the node: 1) no child nodes --> done. 2)1 Child node --> This child node replaces the target node 3) 2 child nodes --> We replace it with the highest left node / lowest right node ( maintaining the increasing order in the in order traversal in binary tress)