BST – Node to be deleted has only one child.

__________________________________________________

**Top Companies Interview Questions..-**

Microsoft | Amazon | more.. |

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

__________________________________________________

### Related Posts:

- Binary Min – Max Heap
- Provide the Next Siblings Pointers in a Given Binary Tree
- Find the Deepest Left Node in a Binary Tree.
- Print All The Full Nodes in a Binary Tree
- Dynamic Programming – Stairs Climbing Puzzle
- Find the Deepest Node in a Binary Tree.
- Double Threaded Binary Tree Complete Implementation
- Introduction to Threaded Binary Tree
- Get the Sum of all left leaves in a Binary tree
- Delete the Binary Tree