Data Structures | Binary Search Trees | Question 2

Last Updated :
Discuss
Comments

In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right child as non-empty. Which of the following is true about inorder successor needed in delete operation?

Inorder Successor is always a leaf node

Inorder successor is always either a leaf node or a node with empty left child

Inorder successor may be an ancestor of the node

Inorder successor is always either a leaf node or a node with empty right child

This question is part of this quiz :

Top MCQs on Binary Search Tree (BST) Data Structure with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy