search

andrealorenzon / AP_exam

Binary Tree implementation
1 stars 2 forks source link

Node Delete function #16

Open andrealorenzon opened 5 years ago

andrealorenzon commented 5 years ago

Accept as input a key value

Deletes the node with the selected key if present, with all his children nodes

Returns 0 if the node was found and deleted correctly Returns 1 if the node was not found (key not in tree)