Delete binary search tree

-*+delete binary search tree Binary search tree has a unique structure with each node has two child nodes and parent node maintains pointers to both its children. This property plays an important role while designing solutions for BST problems.These problems involve deletion of complete BST, mirroring a BST, replacing parent node with sum of children etc. … Continue reading Delete binary search tree