In algorithms, for BinarySearchTree, for the delete method (def delete(self, data): ), case where the node to delete has 2 children, you need to [...long description...]
Answer
find the leftmost node on the right subtree and copy its value to node to delete, then delete the left most node (that is why you need pointer to left most node and its parent)
Question
In algorithms, for BinarySearchTree, for the delete method (def delete(self, data): ), case where the node to delete has 2 children, you need to [...long description...]
Answer
?
Question
In algorithms, for BinarySearchTree, for the delete method (def delete(self, data): ), case where the node to delete has 2 children, you need to [...long description...]
Answer
find the leftmost node on the right subtree and copy its value to node to delete, then delete the left most node (that is why you need pointer to left most node and its parent)
If you want to change selection, open document below and click on "Move attachment"
pdf
owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p159
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.