Data Structures19 sections · 729 units
Open in CourseQuiz: Binary Search Trees
Test your understanding
BST Concepts
When deleting a node with two children from a BST, why do we use the inorder successor (smallest in right subtree)?
- A.It minimizes the tree height after deletion
- B.It's always a leaf node, making deletion simpler
- C.It's larger than all left descendants and smaller than all other right descendants, maintaining BST property
- D.It's the closest value to the deleted node