In a binary search tree when a node is deleted, to maintain the property of it
1
we can replace the deleted node with immediate successor or predecessor and recursively do the same until property is restored.
2
we can recusively move the larger child up to replace the deleted parent.
3
we can recusively move the smaller child up to replace the deleted parent.
4
Both B and C