Question
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted
ii)_____________________________________
iii) delete the node at _____________________
what must be statement ii) and fill up statement iii)
i) from root search for the node to be deleted
ii)_____________________________________
iii) delete the node at _____________________
what must be statement ii) and fill up statement iii)
Answer: Option D
Was this answer helpful ?
We just replace a to be deleted node with last leaf node of a tree. this must not be done in case of BST or heaps.
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution