trees and deleting and findingn nodes Flashcards
1
Q
Describe the steps an algorithm will follow to delete node ‘E’ from the tree
A
search the tree for the node E
make the contents of E null
make the connecting nodes point to what E was pointing too
add node E to an empty list.
