engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Programming and Data Structure Binary Heap Binary Search Tree
In binary search tree, what happens to inorder successor of a node when we delete that node which has both left and right child as non-empty?
1
Inorder successor gets deleted
2
Inorder successor is now root of the binary search tree
3
Inorder successor replaces the node
4
None of the above