Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap Binary Search Tree
Which statement(s) is/are correct regarding node N deletion in binary search tree?
I. If node N has no children then just replace location of N in the parent node by the null pointer.
II. If node N has two children, then replace it by preorder successor.
1
Neither I nor II
2
Both I and II
3
Only I
4
Only II