Ask your own question, for FREE!
Computer Science 14 Online
OpenStudy (anonymous):

How do you remove an entry in a binary search tree with recursion?

OpenStudy (anonymous):

Well, first you have to find the element, then you have the parent can remove it. It'd help to know what language you're talking about and what the tree data is like.

OpenStudy (rsmith6559):

You recurse to the node. Finding it is the base case. Deleting and checking and rebalancing after the deletion would be before unwinding, which would primarily be returning a success code.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
Arriyanalol: i need help
1 day ago 7 Replies 1 Medal
Arriyanalol: CONGRATS to me
1 day ago 8 Replies 2 Medals
Legomaster346: What colleges are good that are near Arab Alabama?
1 week ago 5 Replies 0 Medals
Arriyanalol: i need help
1 week ago 6 Replies 2 Medals
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!