a) ii)-find random node,replace with node to be deleted. iii)- delete the node
b) ii)-find node to be deleted. iii)- delete the node at found location
c) ii)-find deepest node,replace with node to be deleted. iii)- delete a node
d) ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!